{"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/simplifying-neural-machine-translation-with","title":"Simplifying Neural Machine Translation with Addition-Subtraction Twin-Gated Recurrent Networks","arxiv_id":"1810.12546","date":"2018-10-30","proceeding":"EMNLP 2018 10","authors":["Biao Zhang","Deyi Xiong","Jinsong Su","Qian Lin","Huiji Zhang"],"abstract":"In this paper, we propose an additionsubtraction twin-gated recurrent network\n(ATR) to simplify neural machine translation. The recurrent units of ATR are\nheavily simplified to have the smallest number of weight matrices among units\nof all existing gated RNNs. With the simple addition and subtraction operation,\nwe introduce a twin-gated mechanism to build input and forget gates which are\nhighly correlated. Despite this simplification, the essential non-linearities\nand capability of modeling long-distance dependencies are preserved.\nAdditionally, the proposed ATR is more transparent than LSTM/GRU due to the\nsimplification. Forward self-attention can be easily established in ATR, which\nmakes the proposed network interpretable. Experiments on WMT14 translation\ntasks demonstrate that ATR-based neural machine translation can yield\ncompetitive performance on English- German and English-French language pairs in\nterms of both translation quality and speed. Further experiments on NIST\nChinese-English translation, natural language inference and Chinese word\nsegmentation verify the generality and applicability of ATR on different\nnatural language processing tasks.","url_abs":"http://arxiv.org/abs/1810.12546v1","url_pdf":"http://arxiv.org/pdf/1810.12546v1.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":"simplifying-neural-machine-translation-with","repo_url":"https://github.com/bzhangGo/ATR","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"simplifying-neural-machine-translation-with","repo_url":"https://github.com/bzhangGo/zero","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":null},{"paper_slug":"simplifying-neural-machine-translation-with","repo_url":"https://github.com/bzhangGo/lrn","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"chinese-word-segmentation","task_name":"Chinese Word Segmentation"},{"task_slug":"machine-translation","task_name":"Machine Translation"},{"task_slug":"natural-language-inference","task_name":"Natural Language Inference"},{"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":"bzhangGo/ATR","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"bzhangGo/zero","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":5,"harvested_for":["1706.03762","1803.02155","2004.11867","2104.07012","2206.04571"],"harvested_for_calls":[{"arxiv_id":"1706.03762","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1706.03762"},"call":"get_harvested_code_for_paper(arxiv_id=\"1706.03762\")"},{"arxiv_id":"1803.02155","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1803.02155"},"call":"get_harvested_code_for_paper(arxiv_id=\"1803.02155\")"},{"arxiv_id":"2004.11867","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2004.11867"},"call":"get_harvested_code_for_paper(arxiv_id=\"2004.11867\")"},{"arxiv_id":"2104.07012","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2104.07012"},"call":"get_harvested_code_for_paper(arxiv_id=\"2104.07012\")"},{"arxiv_id":"2206.04571","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2206.04571"},"call":"get_harvested_code_for_paper(arxiv_id=\"2206.04571\")"}]},{"repo":"bzhangGo/lrn","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"6f72b7daeb51da6a82bc7c088f468a381485e6390594cef777fa23f153e9421c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}