{"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/a-simple-approach-to-learn-polysemous-word","title":"A Simple Approach to Learn Polysemous Word Embeddings","arxiv_id":"1707.01793","date":"2017-07-06","proceeding":null,"authors":["Yifan Sun","Nikhil Rao","Weicong Ding"],"abstract":"Many NLP applications require disambiguating polysemous words. Existing\nmethods that learn polysemous word vector representations involve first\ndetecting various senses and optimizing the sense-specific embeddings\nseparately, which are invariably more involved than single sense learning\nmethods such as word2vec. Evaluating these methods is also problematic, as\nrigorous quantitative evaluations in this space is limited, especially when\ncompared with single-sense embeddings. In this paper, we propose a simple\nmethod to learn a word representation, given any context. Our method only\nrequires learning the usual single sense representation, and coefficients that\ncan be learnt via a single pass over the data. We propose several new test sets\nfor evaluating word sense induction, relevance detection, and contextual word\nsimilarity, significantly supplementing the currently available tests. Results\non these and other tests show that while our method is embarrassingly simple,\nit achieves excellent results when compared to the state of the art models for\nunsupervised polysemous word representation learning.","url_abs":"http://arxiv.org/abs/1707.01793v2","url_pdf":"http://arxiv.org/pdf/1707.01793v2.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":[{"paper_slug":"a-simple-approach-to-learn-polysemous-word","repo_url":"https://github.com/dingwc/multisense","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null},{"paper_slug":"a-simple-approach-to-learn-polysemous-word","repo_url":"https://github.com/SagarDollin/unsupervised_WSD_on_top_of_word2vec","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"relevance-detection","task_name":"Relevance Detection"},{"task_slug":"representation-learning","task_name":"Representation Learning"},{"task_slug":"word-embeddings","task_name":"Word Embeddings"},{"task_slug":"word-sense-induction","task_name":"Word Sense Induction"},{"task_slug":"word-similarity","task_name":"Word Similarity"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"dingwc/multisense","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"SagarDollin/unsupervised_WSD_on_top_of_word2vec","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"e1fddabc121c93d4ca0ed08564b716fbf8cb51082abf8a1da37798a190fd9109","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}