CLMar 30, 2016

Unsupervised Measure of Word Similarity: How to Outperform Co-occurrence and Vector Cosine in VSMs

arXiv:1603.09054v121 citations
Originality Incremental advance
AI Analysis

This addresses the challenge of improving word similarity accuracy for natural language processing tasks, though it is incremental as it builds on existing methods like Average Precision.

The paper tackles the problem of measuring word similarity in Vector Space Models by proposing APSyn, an unsupervised measure based on the intersection of mutually dependent contexts, which outperforms vector cosine and co-occurrence on the ESL test set with improvements of 9.00% to 17.98%.

In this paper, we claim that vector cosine, which is generally considered among the most efficient unsupervised measures for identifying word similarity in Vector Space Models, can be outperformed by an unsupervised measure that calculates the extent of the intersection among the most mutually dependent contexts of the target words. To prove it, we describe and evaluate APSyn, a variant of the Average Precision that, without any optimization, outperforms the vector cosine and the co-occurrence on the standard ESL test set, with an improvement ranging between +9.00% and +17.98%, depending on the number of chosen top contexts.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes