Solving Cosine Similarity Underestimation between High Frequency Words by ℓ2 Norm Discounting

ISSN: 0736587X
2Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

Abstract

Cosine similarity between two words, computed using their contextualised token embeddings obtained from masked language models (MLMs) such as BERT has shown to underestimate the actual similarity between those words (Zhou et al., 2022). This similarity underestimation problem is particularly severe for highly frequent words. Although this problem has been noted in prior work, no solution has been proposed thus far. We observe that the ℓ2 norm of contextualised embeddings of a word correlates with its log-frequency in the pretraining corpus. Consequently, the larger ℓ2 norms associated with the highly frequent words reduce the cosine similarity values measured between them, thus underestimating the similarity scores. To solve this issue, we propose a method to discount the ℓ2 norm of a contextualised word embedding by the frequency of that word in a corpus when measuring the cosine similarities between words. We show that the so called stop words behave differently from the rest of the words, which require special consideration during their discounting process. Experimental results on a contextualised word similarity dataset show that our proposed discounting method accurately solves the similarity underestimation problem.

Cite

CITATION STYLE

APA

Wannasuphoprasit, S., Zhou, Y., & Bollegala, D. (2023). Solving Cosine Similarity Underestimation between High Frequency Words by ℓ2 Norm Discounting. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (pp. 8644–8652). Association for Computational Linguistics (ACL).

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free