{"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/deep-neural-machine-translation-with-weakly","title":"Deep Neural Machine Translation with Weakly-Recurrent Units","arxiv_id":"1805.04185","date":"2018-05-10","proceeding":null,"authors":["Mattia Antonino Di Gangi","Marcello Federico"],"abstract":"Recurrent neural networks (RNNs) have represented for years the state of the\nart in neural machine translation. Recently, new architectures have been\nproposed, which can leverage parallel computation on GPUs better than classical\nRNNs. Faster training and inference combined with different\nsequence-to-sequence modeling also lead to performance improvements. While the\nnew models completely depart from the original recurrent architecture, we\ndecided to investigate how to make RNNs more efficient. In this work, we\npropose a new recurrent NMT architecture, called Simple Recurrent NMT, built on\na class of fast and weakly-recurrent units that use layer normalization and\nmultiple attentions. Our experiments on the WMT14 English-to-German and WMT16\nEnglish-Romanian benchmarks show that our model represents a valid alternative\nto LSTMs, as it can achieve better results at a significantly lower\ncomputational cost.","url_abs":"http://arxiv.org/abs/1805.04185v1","url_pdf":"http://arxiv.org/pdf/1805.04185v1.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":"deep-neural-machine-translation-with-weakly","repo_url":"https://github.com/mattiadg/SR-NMT","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"machine-translation","task_name":"Machine Translation"},{"task_slug":"nmt","task_name":"NMT"},{"task_slug":"translation","task_name":"Translation"},{"task_slug":null,"task_name":"valid"}],"methods":[{"method_slug":"layer-normalization","method_name":"Layer Normalization"}],"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":"mattiadg/SR-NMT","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":"f5221a688c59e87f5b14f4b975a7dfe307d04acc3a0f80fbfb53ff1ce7d908b0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}