Card-660: Cambridge Rare Word Dataset - a Reliable Benchmark for Infrequent Word Representation Models
Mohammad Taher Pilehvar, Dimitri Kartsaklis, Victor Prokhorov, Nigel, Collier

TL;DR
The paper introduces Card-660, a new expert-annotated benchmark dataset for evaluating rare word representation models, addressing limitations of previous benchmarks and revealing current models' performance gaps.
Contribution
It presents a reliable, challenging benchmark dataset for rare word representations, filling a critical evaluation gap in the field.
Findings
Existing models score below 0.43 on Card-660
Human upperbound is 0.90
The dataset is expert-annotated and publicly available
Abstract
Rare word representation has recently enjoyed a surge of interest, owing to the crucial role that effective handling of infrequent words can play in accurate semantic understanding. However, there is a paucity of reliable benchmarks for evaluation and comparison of these techniques. We show in this paper that the only existing benchmark (the Stanford Rare Word dataset) suffers from low-confidence annotations and limited vocabulary; hence, it does not constitute a solid comparison framework. In order to fill this evaluation gap, we propose CAmbridge Rare word Dataset (Card-660), an expert-annotated word similarity dataset which provides a highly reliable, yet challenging, benchmark for rare word representation techniques. Through a set of experiments we show that even the best mainstream word embeddings, with millions of words in their vocabularies, are unable to achieve performances…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
