{"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/incorporating-discrete-translation-lexicons","title":"Incorporating Discrete Translation Lexicons into Neural Machine Translation","arxiv_id":"1606.02006","date":"2016-06-07","proceeding":"EMNLP 2016 11","authors":["Philip Arthur","Graham Neubig","Satoshi Nakamura"],"abstract":"Neural machine translation (NMT) often makes mistakes in translating\nlow-frequency content words that are essential to understanding the meaning of\nthe sentence. We propose a method to alleviate this problem by augmenting NMT\nsystems with discrete translation lexicons that efficiently encode translations\nof these low-frequency words. We describe a method to calculate the lexicon\nprobability of the next word in the translation candidate by using the\nattention vector of the NMT model to select which source word lexical\nprobabilities the model should focus on. We test two methods to combine this\nprobability with the standard NMT probability: (1) using it as a bias, and (2)\nlinear interpolation. Experiments on two corpora show an improvement of 2.0-2.3\nBLEU and 0.13-0.44 NIST score, and faster convergence time.","url_abs":"http://arxiv.org/abs/1606.02006v2","url_pdf":"http://arxiv.org/pdf/1606.02006v2.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":"incorporating-discrete-translation-lexicons","repo_url":"https://github.com/duyvuleo/Transformer-DyNet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"incorporating-discrete-translation-lexicons","repo_url":"https://github.com/tnq177/improving_lexical_choice_in_nmt","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"machine-translation","task_name":"Machine Translation"},{"task_slug":"nmt","task_name":"NMT"},{"task_slug":"sentence","task_name":"Sentence"},{"task_slug":"translation","task_name":"Translation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1606.02006","atlas_url":"https://app.syntology.ai/?focus=1606.02006","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":"1606.02006"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1606.02006\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1606.02006"},"call":"get_concepts_for_paper(arxiv_id=\"1606.02006\")"}],"by_repo":[{"repo":"duyvuleo/Transformer-DyNet","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"tnq177/improving_lexical_choice_in_nmt","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1710.01329"],"harvested_for_calls":[{"arxiv_id":"1710.01329","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1710.01329"},"call":"get_harvested_code_for_paper(arxiv_id=\"1710.01329\")"}]}],"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":"896c35f0b6598eb19882c41111afbc56c7a35279510f08645d03debff71d62cd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}