A Rank-based Similarity Metric For Word Embeddings | Awesome Learning to Hash Add your paper to Learning2Hash

A Rank-based Similarity Metric For Word Embeddings

Enrico Santus, Hongmin Wang, Emmanuele Chersoni, Yue Zhang . Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers) 2018 – 14 citations

[Paper]   Search on Google Scholar   Search on Semantic Scholar
Distance Metric Learning Evaluation

Word Embeddings have recently imposed themselves as a standard for representing word meaning in NLP. Semantic similarity between word pairs has become the most common evaluation benchmark for these representations, with vector cosine being typically used as the only similarity metric. In this paper, we report experiments with a rank-based metric for WE, which performs comparably to vector cosine in similarity estimation and outperforms it in the recently-introduced and challenging task of outlier detection, thus suggesting that rank-based measures can improve clustering quality.

Similar Work