{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/word-tour-one-dimensional-word-embeddings-via","title":"Word Tour: One-dimensional Word Embeddings via the Traveling Salesman Problem","arxiv_id":"2205.01954","date":"2022-05-04","proceeding":"NAACL 2022 7","authors":["Ryoma Sato"],"abstract":"Word embeddings are one of the most fundamental technologies used in natural language processing. Existing word embeddings are high-dimensional and consume considerable computational resources. In this study, we propose WordTour, unsupervised one-dimensional word embeddings. To achieve the challenging goal, we propose a decomposition of the desiderata of word embeddings into two parts, completeness and soundness, and focus on soundness in this paper. Owing to the single dimensionality, WordTour is extremely efficient and provides a minimal means to handle word embeddings. We experimentally confirmed the effectiveness of the proposed method via user study and document classification.","url_abs":"https://arxiv.org/abs/2205.01954v1","url_pdf":"https://arxiv.org/pdf/2205.01954v1.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":"word-tour-one-dimensional-word-embeddings-via","repo_url":"https://github.com/joisino/wordtour","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"document-classification","task_name":"Document Classification"},{"task_slug":"traveling-salesman-problem","task_name":"Traveling Salesman Problem"},{"task_slug":"word-embeddings","task_name":"Word Embeddings"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":"https://app.syntology.ai/?focus=2205.01954","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.01954"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"deterministic:regex_extraction","url":"https://github.com/joisino/wordtour","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":5},"by_repo_kind":{"official":{"samples":5,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"84b4cc8f1b65312f","entry":"blur_bow","repo":"joisino/wordtour","repo_kind":"official","path":"evaluate.py","file_url":"https://github.com/joisino/wordtour/blob/HEAD/evaluate.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"84b4cc8f1b65312f"}},{"code_sha256_prefix":"f162845555517a40","entry":"evaluate_D","repo":"joisino/wordtour","repo_kind":"official","path":"evaluate.py","file_url":"https://github.com/joisino/wordtour/blob/HEAD/evaluate.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"f162845555517a40"}},{"code_sha256_prefix":"e6fc461d6d1e594b","entry":"load","repo":"joisino/wordtour","repo_kind":"official","path":"preprocess.py","file_url":"https://github.com/joisino/wordtour/blob/HEAD/preprocess.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"e6fc461d6d1e594b"}},{"code_sha256_prefix":"f1dd3b3e7a763020","entry":"load_glove","repo":"joisino/wordtour","repo_kind":"official","path":"util.py","file_url":"https://github.com/joisino/wordtour/blob/HEAD/util.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"f1dd3b3e7a763020"}},{"code_sha256_prefix":"44624b0d066f83dd","entry":"select_k_sigma","repo":"joisino/wordtour","repo_kind":"official","path":"evaluate.py","file_url":"https://github.com/joisino/wordtour/blob/HEAD/evaluate.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"44624b0d066f83dd"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}