pith. sign in

arxiv: 1805.01923 · v1 · pith:DJOAQ6DNnew · submitted 2018-05-04 · 💻 cs.CL

A Rank-Based Similarity Metric for Word Embeddings

classification 💻 cs.CL
keywords similaritywordmetricrank-basedcosineembeddingsvectorbecome
0
0 comments X p. Extension
pith:DJOAQ6DN Add to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{DJOAQ6DN}

Prints a linked pith:DJOAQ6DN badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.