Challenge: Existing methods to estimate document similarity based on word embeddings are mediocre . a recent study compared word and sentence embedded documents to a similarity estimate using matrix norms.
Approach: They propose to combine word embeddings with matrix norms to obtain a similarity estimate.
Outcome: The proposed method produces superior results for most of the investigated matrix norms compared to the classical cosine measure and several other similarity estimates.

Similar Papers

A Rank-Based Similarity Metric for Word Embeddings (P18-2)

Copied to clipboard

Challenge: Word Embeddings have become a standard for word representations, with vector cosine being the only similarity metric.
Approach: They propose to use rank-based similarity estimation metrics to measure word similarity . they find WE outperforms vector cosine in the recent outlier detection task .
Outcome: The proposed rank-based measure outperforms vector cosine in the recent outlier detection task.
Correlation Coefficients and Semantic Textual Similarity (N19-1)

Copied to clipboard

Challenge: Existing research into semantic textual similarity has focused on word embeddings . little attention has been devoted to similarity measures between word embeds - a new study shows .
Approach: They show that cosine similarity is essentially equivalent to the Pearson correlation coefficient for all common word vectors.
Outcome: The proposed model outperforms the existing model on word-level and sentence-level similarity benchmarks.
Problems with Cosine as a Measure of Embedding Similarity for High Frequency Words (2022.acl-short)

Copied to clipboard

Challenge: We find that word similarities estimated by cosine over contextual embeddings are understated and trace this effect to training data frequency.
Approach: They propose to use cosine similarity to estimate word similarities in contextual embeddings to trace this effect to training data frequency.
Outcome: The proposed model underestimates similarity between frequent and low frequency words even after controlling for polysemy and other factors.
Sentiment Classification Using Document Embeddings Trained with Cosine Similarity (P19-2)

Copied to clipboard

Challenge: Existing document embedding models map each document to a dense, low-dimensional vector in continuous vector space.
Approach: They propose to train document embeddings using cosine similarity instead of dot product . they focus on document sentiment classification of long movie reviews .
Outcome: The proposed model improves document embedding accuracy by using cosine similarity instead of dot product on the IMDB dataset while using feature combination with Naive Bayes weighted bag of n-grams achieves 93.68% accuracy.
On the Correlation of Word Embedding Evaluation Metrics (2020.lrec-1)

Copied to clipboard

Challenge: Word embeddings are geometrical representations of word paradigmatics and syntagmatics.
Approach: They propose to investigate evaluation metrics on various datasets to find correlations . they propose a fast solution to select the best word embeddings among many others .
Outcome: The proposed method could be used to select the best word embeddings among many others.
Estimating Mutual Information Between Dense Word Embeddings (2020.acl-main)

Copied to clipboard

Challenge: Word embedding-based similarity measures are among the top-performing methods on unsupervised semantic textual similarity tasks.
Approach: They propose a word embedding similarity measure that is a viable alternative to correlations and gives an excellent signal that correlates well with human judgements of similarity.
Outcome: The proposed model outperforms existing state-of-the-art methods on hard NLP tasks.
Revisiting Cosine Similarity via Normalized ICA-transformed Embeddings (2025.coling-main)

Copied to clipboard

Challenge: Existing studies on cosine similarity focus on the angle or correlation coefficient, but this study proposes a novel interpretation of the term word similarity.
Approach: They propose a method for selecting statistically significant axes by deriving the probability distributions that govern each component and the product of components.
Outcome: The proposed interpretation of cosine similarity is demonstrated through intuitive numerical examples and thorough numerical experiments.
Querying Word Embeddings for Similarity and Relatedness (N18-1)

Copied to clipboard

Challenge: Word2Vec embeddings have become popular representations of word meaning . similarity between two words is often assumed to be a direction-less measure, whereas relatedness is inherently directional.
Approach: They propose to use word embeddings to predict asymmetric association between words from a dataset of production norms to generate thematically related words.
Outcome: The proposed model predicts asymmetric association between words from a recently published dataset of production norms.
Interpretable Text Embeddings and Text Similarity Explanation: A Survey (2025.emnlp-main)

Copied to clipboard

Challenge: Text embeddings are a fundamental component in many NLP tasks, but their interpretation and explanation remain challenging.
Approach: They propose a framework for interpretable text embeddings and text similarity explanation . they characterize the main ideas, approaches, and trade-offs and discuss lessons learned .
Outcome: The proposed methods are compared with existing models and compare them with existing ones.
A Document Descriptor using Covariance of Word Vectors (P18-2)

Copied to clipboard

Challenge: Existing methods for retrieving documents using vectors have been used to model documents and queries using bag-of-words (BOW) representations.
Approach: They propose to use the word embeddings of a document to define a novel document descriptor.
Outcome: The proposed descriptor performs well against state-of-the-art methods in supervised and unsupervised environments.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations