CLAIOct 7, 2020

Analogies minus analogy test: measuring regularities in word embeddings

arXiv:2010.03446v11000 citations
Originality Incremental advance
AI Analysis

This work addresses a methodological problem for researchers in natural language processing by providing improved evaluation metrics for word embeddings.

The authors tackled the problem of evaluating whether word embeddings capture linguistic regularities by decomposing the classic analogy test and proposing two new metrics to address its flaws, showing that popular embeddings do encode such regularities despite the test's issues.

Vector space models of words have long been claimed to capture linguistic regularities as simple vector translations, but problems have been raised with this claim. We decompose and empirically analyze the classic arithmetic word analogy test, to motivate two new metrics that address the issues with the standard test, and which distinguish between class-wise offset concentration (similar directions between pairs of words drawn from different broad classes, such as France--London, China--Ottawa, ...) and pairing consistency (the existence of a regular transformation between correctly-matched pairs such as France:Paris::China:Beijing). We show that, while the standard analogy test is flawed, several popular word embeddings do nevertheless encode linguistic regularities.

Code Implementations1 repo
Foundations

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

Your Notes