{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/card-660-cambridge-rare-word-dataset-a","title":"Card-660: Cambridge Rare Word Dataset - a Reliable Benchmark for Infrequent Word Representation Models","arxiv_id":"1808.09308","date":"2018-08-28","proceeding":"EMNLP 2018 10","authors":["Mohammad Taher Pilehvar","Dimitri Kartsaklis","Victor Prokhorov","Nigel Collier"],"abstract":"Rare word representation has recently enjoyed a surge of interest, owing to\nthe crucial role that effective handling of infrequent words can play in\naccurate semantic understanding. However, there is a paucity of reliable\nbenchmarks for evaluation and comparison of these techniques. We show in this\npaper that the only existing benchmark (the Stanford Rare Word dataset) suffers\nfrom low-confidence annotations and limited vocabulary; hence, it does not\nconstitute a solid comparison framework. In order to fill this evaluation gap,\nwe propose CAmbridge Rare word Dataset (Card-660), an expert-annotated word\nsimilarity dataset which provides a highly reliable, yet challenging, benchmark\nfor rare word representation techniques. Through a set of experiments we show\nthat even the best mainstream word embeddings, with millions of words in their\nvocabularies, are unable to achieve performances higher than 0.43 (Pearson\ncorrelation) on the dataset, compared to a human-level upperbound of 0.90. We\nrelease the dataset and the annotation materials at\nhttps://pilehvar.github.io/card-660/.","url_abs":"http://arxiv.org/abs/1808.09308v1","url_pdf":"http://arxiv.org/pdf/1808.09308v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[],"tasks":[{"task_slug":"word-embeddings","task_name":"Word Embeddings"},{"task_slug":"word-similarity","task_name":"Word Similarity"}],"methods":[],"datasets_introduced":[{"slug":"card-660","name":"CARD-660","full_name":""}],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1808.09308","atlas_url":"https://app.syntology.ai/?focus=1808.09308","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1808.09308"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1808.09308\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1808.09308"},"call":"get_concepts_for_paper(arxiv_id=\"1808.09308\")"}],"by_repo":[],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"7b88e834ceb2f412cff79d5a56d78018ec8cf671e90d4aa862bec9c201c6ecc3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}