{"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/greedy-search-with-probabilistic-n-gram","title":"Greedy Search with Probabilistic N-gram Matching for Neural Machine Translation","arxiv_id":"1809.03132","date":"2018-09-10","proceeding":"EMNLP 2018 10","authors":["Chenze Shao","Yang Feng","Xilin Chen"],"abstract":"Neural machine translation (NMT) models are usually trained with the\nword-level loss using the teacher forcing algorithm, which not only evaluates\nthe translation improperly but also suffers from exposure bias. Sequence-level\ntraining under the reinforcement framework can mitigate the problems of the\nword-level loss, but its performance is unstable due to the high variance of\nthe gradient estimation. On these grounds, we present a method with a\ndifferentiable sequence-level training objective based on probabilistic n-gram\nmatching which can avoid the reinforcement framework. In addition, this method\nperforms greedy search in the training which uses the predicted words as\ncontext just as at inference to alleviate the problem of exposure bias.\nExperiment results on the NIST Chinese-to-English translation tasks show that\nour method significantly outperforms the reinforcement-based algorithms and\nachieves an improvement of 1.5 BLEU points on average over a strong baseline\nsystem.","url_abs":"http://arxiv.org/abs/1809.03132v1","url_pdf":"http://arxiv.org/pdf/1809.03132v1.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":"greedy-search-with-probabilistic-n-gram","repo_url":"https://github.com/ictnlp/GS4NMT","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"machine-translation","task_name":"Machine Translation"},{"task_slug":"nmt","task_name":"NMT"},{"task_slug":"translation","task_name":"Translation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1809.03132","atlas_url":"https://app.syntology.ai/?focus=1809.03132","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":"1809.03132"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1809.03132\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1809.03132"},"call":"get_concepts_for_paper(arxiv_id=\"1809.03132\")"}],"by_repo":[{"repo":"ictnlp/GS4NMT","kind":"official","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":"b5232a411071b4497ad90f1de6286ec8dce5d97a47341ab8069de100c9a428ee","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}