{"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/word-and-phrase-translation-with-word2vec","title":"Word and Phrase Translation with word2vec","arxiv_id":"1705.03127","date":"2017-05-09","proceeding":null,"authors":["Stefan Jansen"],"abstract":"Word and phrase tables are key inputs to machine translations, but costly to\nproduce. New unsupervised learning methods represent words and phrases in a\nhigh-dimensional vector space, and these monolingual embeddings have been shown\nto encode syntactic and semantic relationships between language elements. The\ninformation captured by these embeddings can be exploited for bilingual\ntranslation by learning a transformation matrix that allows matching relative\npositions across two monolingual vector spaces. This method aims to identify\nhigh-quality candidates for word and phrase translation more cost-effectively\nfrom unlabeled data.\n  This paper expands the scope of previous attempts of bilingual translation to\nfour languages (English, German, Spanish, and French). It shows how to process\nthe source data, train a neural network to learn the high-dimensional\nembeddings for individual languages and expands the framework for testing their\nquality beyond the English language. Furthermore, it shows how to learn\nbilingual transformation matrices and obtain candidates for word and phrase\ntranslation, and assess their quality.","url_abs":"http://arxiv.org/abs/1705.03127v4","url_pdf":"http://arxiv.org/pdf/1705.03127v4.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-and-phrase-translation-with-word2vec","repo_url":"https://github.com/svjan5/CNN-for-text-classification","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"translation","task_name":"Translation"}],"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":"svjan5/CNN-for-text-classification","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1408.5882"],"harvested_for_calls":[{"arxiv_id":"1408.5882","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1408.5882"},"call":"get_harvested_code_for_paper(arxiv_id=\"1408.5882\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"529de54da6a9955fa9b9482b9a9e49f4ddfd100d6cf3d1168ed3609fb169ccbc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}