{"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/hyperlex-a-large-scale-evaluation-of-graded","title":"HyperLex: A Large-Scale Evaluation of Graded Lexical Entailment","arxiv_id":"1608.02117","date":"2016-08-06","proceeding":"CL 2017 12","authors":["Ivan Vulić","Daniela Gerz","Douwe Kiela","Felix Hill","Anna Korhonen"],"abstract":"We introduce HyperLex - a dataset and evaluation resource that quantifies the\nextent of of the semantic category membership, that is, type-of relation also\nknown as hyponymy-hypernymy or lexical entailment (LE) relation between 2,616\nconcept pairs. Cognitive psychology research has established that typicality\nand category/class membership are computed in human semantic memory as a\ngradual rather than binary relation. Nevertheless, most NLP research, and\nexisting large-scale invetories of concept category membership (WordNet,\nDBPedia, etc.) treat category membership and LE as binary. To address this, we\nasked hundreds of native English speakers to indicate typicality and strength\nof category membership between a diverse range of concept pairs on a\ncrowdsourcing platform. Our results confirm that category membership and LE are\nindeed more gradual than binary. We then compare these human judgements with\nthe predictions of automatic systems, which reveals a huge gap between human\nperformance and state-of-the-art LE, distributional and representation learning\nmodels, and substantial differences between the models themselves. We discuss a\npathway for improving semantic models to overcome this discrepancy, and\nindicate future application areas for improved graded LE systems.","url_abs":"http://arxiv.org/abs/1608.02117v2","url_pdf":"http://arxiv.org/pdf/1608.02117v2.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":"lexical-entailment","task_name":"Lexical Entailment"},{"task_slug":null,"task_name":"Relation"},{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[],"datasets_introduced":[{"slug":"hyperlex","name":"HyperLex","full_name":""}],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1608.02117","atlas_url":"https://app.syntology.ai/?focus=1608.02117","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":"1608.02117"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1608.02117\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1608.02117"},"call":"get_concepts_for_paper(arxiv_id=\"1608.02117\")"}],"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":"05ddf136e68e3698cdb4a6b326222f0b3b109cc6ef93361641fa0d162420437d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}