{"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":"/task/low-resource-nmt","name":"Low Resource NMT","slug":"low-resource-nmt","description_markdown":null,"categories":[{"name":"Natural Language Processing","url":"/area/natural-language-processing"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":34,"papers_with_code":11,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":1},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[{"url":"/task/machine-translation","name":"Machine Translation"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":34,"of":34,"of_with_code":11,"tagged_in_all":34,"counts":{"archive_papers_tagged":34,"with_a_code_link":11,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":34,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/revisiting-low-resource-neural-machine","slug":"revisiting-low-resource-neural-machine","title":"Revisiting Low-Resource Neural Machine Translation: A Case Study","date":"2019-05-28","arxiv_id":"1905.11901","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/revisiting-low-resource-neural-machine#ran","syntology_url":"https://syntology.ai/paper/1905.11901","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11901"}},"official":null}},{"url":"/paper/from-priest-to-doctor-domain-adaptaion-for","slug":"from-priest-to-doctor-domain-adaptaion-for","title":"From Priest to Doctor: Domain Adaptaion for Low-Resource Neural Machine Translation","date":"2024-12-01","arxiv_id":"2412.00966","repositories_listed":1,"syntology":null},{"url":"/paper/low-resource-neural-machine-translation-with-1","slug":"low-resource-neural-machine-translation-with-1","title":"Low-resource neural machine translation with morphological modeling","date":"2024-04-03","arxiv_id":"2404.02392","repositories_listed":1,"syntology":null},{"url":"/paper/joint-dropout-improving-generalizability-in","slug":"joint-dropout-improving-generalizability-in","title":"Joint Dropout: Improving Generalizability in Low-Resource Neural Machine Translation through Phrase Pair Variables","date":"2023-07-24","arxiv_id":"2307.12835","repositories_listed":1,"syntology":null},{"url":"/paper/consisttl-modeling-consistency-in-transfer","slug":"consisttl-modeling-consistency-in-transfer","title":"ConsistTL: Modeling Consistency in Transfer Learning for Low-Resource Neural Machine Translation","date":"2022-12-08","arxiv_id":"2212.04262","repositories_listed":1,"syntology":null},{"url":"/paper/hft-high-frequency-tokens-for-low-resource","slug":"hft-high-frequency-tokens-for-low-resource","title":"HFT: High Frequency Tokens for Low-Resource NMT","date":"2022-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/towards-better-chinese-centric-neural-machine","slug":"towards-better-chinese-centric-neural-machine","title":"Towards Better Chinese-centric Neural Machine Translation for Low-resource Languages","date":"2022-04-09","arxiv_id":"2204.04344","repositories_listed":1,"syntology":null},{"url":"/paper/sicilian-translator-a-recipe-for-low-resource","slug":"sicilian-translator-a-recipe-for-low-resource","title":"Sicilian Translator: A Recipe for Low-Resource NMT","date":"2021-10-05","arxiv_id":"2110.01938","repositories_listed":1,"syntology":null},{"url":"/paper/low-resource-nmt-an-empirical-study-on-the","slug":"low-resource-nmt-an-empirical-study-on-the","title":"Low-Resource NMT: an Empirical Study on the Effect of Rich Morphological Word Segmentation on Inuktitut","date":"2020-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/jass-japanese-specific-sequence-to-sequence","slug":"jass-japanese-specific-sequence-to-sequence","title":"JASS: Japanese-specific Sequence to Sequence Pre-training for Neural Machine Translation","date":"2020-05-07","arxiv_id":"2005.03361","repositories_listed":1,"syntology":null},{"url":"/paper/on-optimal-transformer-depth-for-low-resource","slug":"on-optimal-transformer-depth-for-low-resource","title":"On Optimal Transformer Depth for Low-Resource Language Translation","date":"2020-04-09","arxiv_id":"2004.04418","repositories_listed":1,"syntology":null},{"url":null,"slug":"beyond-vanilla-fine-tuning-leveraging","title":"Beyond Vanilla Fine-Tuning: Leveraging Multistage, Multilingual, and Domain-Specific Methods for Low-Resource Machine Translation","date":"2025-03-28","arxiv_id":"2503.22582","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantity-vs-quality-of-monolingual-source","title":"Quantity vs. Quality of Monolingual Source Data in Automatic Text Translation: Can It Be Too Little If It Is Too Good?","date":"2024-10-17","arxiv_id":"2410.13783","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-quality-data-augmentation-for-low","title":"High-Quality Data Augmentation for Low-Resource NMT: Combining a Translation Memory, a GAN Generator, and Filtering","date":"2024-08-22","arxiv_id":"2408.12079","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-low-resource-nmt-with-a","title":"Enhancing Low-Resource NMT with a Multilingual Encoder and Knowledge Distillation: A Case Study","date":"2024-07-09","arxiv_id":"2407.06538","repositories_listed":0,"syntology":null},{"url":null,"slug":"direct-neural-machine-translation-with-task","title":"Direct Neural Machine Translation with Task-level Mixture of Experts models","date":"2023-10-18","arxiv_id":"2310.12236","repositories_listed":0,"syntology":null},{"url":null,"slug":"featurebart-feature-based-sequence-to","title":"FeatureBART: Feature Based Sequence-to-Sequence Pre-Training for Low-Resource NMT","date":"2022-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"taking-actions-separately-a-bidirectionally","title":"Taking Actions Separately: A Bidirectionally-Adaptive Transfer Learning Method for Low-Resource Neural Machine Translation","date":"2022-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-systematic-study-reveals-unexpected","title":"A Systematic Study Reveals Unexpected Interactions in Pre-Trained Neural Machine Translation","date":"2022-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"controlling-formality-in-low-resource-nmt","title":"Controlling Formality in Low-Resource NMT with Domain Adaptation and Re-Ranking: SLT-CDT-UoS at IWSLT2022","date":"2022-05-12","arxiv_id":"2205.05990","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-translation-for-livonian-catering-to","title":"Machine Translation for Livonian: Catering to 20 Speakers","date":"2022-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-effectiveness-of-quasi-character-level-1","title":"On the Effectiveness of Quasi Character-Level Models for Machine Translation","date":"2022-01-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-effectiveness-of-quasi-character-level","title":"On the Effectiveness of Quasi Character-Level Models for Machine Translation","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-low-resource-neural-machine","title":"A Survey on Low-Resource Neural Machine Translation","date":"2021-07-09","arxiv_id":"2107.04239","repositories_listed":0,"syntology":null},{"url":null,"slug":"augvic-exploiting-bitext-vicinity-for-low","title":"AUGVIC: Exploiting BiText Vicinity for Low-Resource NMT","date":"2021-06-09","arxiv_id":"2106.05141","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-augmentation-for-sign-language-gloss","title":"Data Augmentation for Sign Language Gloss Translation","date":"2021-05-16","arxiv_id":"2105.07476","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-simple-and-general-strategy-for-referential","title":"A Simple and General Strategy for Referential Problem in Low-Resource Neural Machine Translation","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-low-resource-nmt-through-relevance","title":"Improving Low-Resource NMT through Relevance Based Linguistic Features Incorporation","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-curriculum-learning-for-low-resource","title":"Dynamic Curriculum Learning for Low-Resource Neural Machine Translation","date":"2020-11-30","arxiv_id":"2011.14608","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-multi-task-learn-for-better","title":"Learning to Multi-Task Learn for Better Neural Machine Translation","date":"2020-01-10","arxiv_id":"2001.03294","repositories_listed":0,"syntology":null},{"url":null,"slug":"nicts-participation-to-wat-2019","title":"NICT's participation to WAT 2019: Multilingualism and Multi-step Fine-Tuning for Low Resource NMT","date":"2019-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"bilingual-low-resource-neural-machine","title":"Bilingual Low-Resource Neural Machine Translation with Round-Tripping: The Case of Persian-Spanish","date":"2019-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"target-conditioned-sampling-optimizing-data","title":"Target Conditioned Sampling: Optimizing Data Selection for Multilingual Neural Machine Translation","date":"2019-05-20","arxiv_id":"1905.08212","repositories_listed":0,"syntology":null},{"url":null,"slug":"morphological-word-embeddings-for-arabic","title":"Morphological Word Embeddings for Arabic Neural Machine Translation in Low-Resource Settings","date":"2018-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"syntology_records":1,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":1,"papers_where_code_ran_first_page":"/task/low-resource-nmt/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/low-resource-nmt/papers/ran/1","json":"/task/low-resource-nmt/papers/ran/1.json","rows":1}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"39c07a0e1bed702596fdd90fd69c4e3fd8018488a574e7fd5832a97d42d9c004","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}