| sfa_similarity | R Documentation |
Transforms item embeddings into an item-by-item similarity matrix using one of several published methods.
sfa_similarity(
embeddings,
encoding = "atomic",
scoring = NULL,
factors = NULL,
codes = NULL
)
embeddings |
Numeric matrix (n_items x embedding_dim). |
encoding |
Character string specifying the similarity transform:
|
scoring |
Numeric vector of +1/-1 per item (keying direction). Applies
only to the atomic encodings (Guenole et al.); |
factors |
Optional character/factor vector of per-item subscale labels.
When supplied it is recorded on the returned matrix (as a
|
codes |
Optional character vector of short item codes (e.g.
|
"atomic"(default) Cosine similarity of the item embeddings
(computed by L2-normalizing internally). Equivalent to
"atomic_reversed" with all +1 scoring. Named for the atomic
encoding of Guenole et al., who additionally embed items separately and
average within facet; this function operates on the per-item embeddings
it is given.
"atomic_reversed"Multiply each embedding by its scoring direction (+1/-1) first, then cosine similarity (Guenole et al.). Use this for scales with reverse-keyed items.
"squid"Subtract the questionnaire-mean embedding (SQuID; Pellert et al. 2026), then cosine similarity (the L2-normalization is this package's similarity step; Pellert et al. define SQuID as the mean-subtraction and measure similarity by cosine or Pearson afterwards). The centering recovers negative between-dimension correlations, so this encoding is keying-free (no scoring/sign-flip). Pellert et al. note that reverse-keyed items remain an open challenge – they state that meaningfully "reversing" a semantic embedding is conceptually unclear and needs further methodological work, not that centering resolves it.
"mean_centered_pearson"Mean-center each embedding across its dimensions, L2-normalize. Cosine similarity then equals Pearson correlation, yielding a true correlation matrix (the centered-cosine = Pearson identity is attributed by Pokropek (2026) to Chen et al. (2020); see also Kmetty et al. 2021 and Casella et al. 2024). Keying-free.
A symmetric numeric matrix (n_items x n_items) with 1s on the diagonal.
Milano, N., Luongo, M., Ponticorvo, M., & Marocco, D. (2025). Semantic analysis of test items through large language model embeddings predicts a-priori factorial structure of personality tests. Current Research in Behavioral Sciences, 8, 100168. \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1016/j.crbeha.2025.100168")}
Casella, M., Luongo, M., Marocco, D., Milano, N., & Ponticorvo, M. (2024). LLM embeddings on test items predict post hoc loadings in personality tests. Ital-IA 2024: 4th National Conference on Artificial Intelligence, CEUR Workshop Proceedings.
Guenole, N., D'Urso, E. D., Samo, A., Sun, T., & Haslbeck, J. M. B. (Preprint). Enhancing Scale Development: Pseudo Factor Analysis of Language Embedding Similarity Matrices. OSF. https://osf.io/3mpzb/
Pellert, M., Lechner, C. M., Sen, I., & Strohmaier, M. (2026). Neural network embeddings recover value dimensions from psychometric survey items on par with human data (Survey and Questionnaire Item Embeddings Differentials, SQuID). Findings of the Association for Computational Linguistics: EACL 2026, 5738–5752.
Pokropek, A. (2026). From keyword-based text measures to latent variables: Confirmatory factor analysis with word embeddings. EPJ Data Science. \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1140/epjds/s13688-026-00654-1")}
Chen, X., Ding, N., Levinboim, T., & Soricut, R. (2020). Improving text generation evaluation with batch centering and tempered word mover distance. Proceedings of the First Workshop on Evaluation and Comparison of NLP Systems (Eval4NLP), 51–59.
Kmetty, Z., Koltai, J., & Rudas, T. (2021). The presence of occupational structure in online texts based on word embedding NLP models. EPJ Data Science, 10, 55. \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1140/epjds/s13688-021-00311-9")}
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.