Pith. sign in

REVIEW 2 major objections 6 minor 47 references

From Priest to Doctor: Domain Adaptation for Low-Resource Neural Machine Translation

T0 review · 2 major / 6 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A simple dictionary-based data augmentation method, DALI, more than doubles ChrF over an mBART baseline in low-resource domain adaptation, though output quality remains low.

desk verdict A solid, honest empirical comparison showing that a simple dictionary-based forward-translation method (DALI) beats more complex adaptation methods for low-resource NMT, with the main caveat being the dictionary-availability assumption the authors themselves flag. read the letter →

arxiv 2412.00966 v3 pith:24S5MXRJ submitted 2024-12-01 cs.CL cs.LG

Ali Marashian , Enora Rice , Luke Gessler , Alexis Palmer , Katharina von der Wense This is my paper · ORCID
classification cs.CLcs.LG
keywords low-resourcemachinetranslationdomainadaptationneuralbilingualdictionarypseudo-paralleldatamBARTDALIBiblecorpus
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper argues that for the neglected case of domain adaptation in low-resource neural machine translation—where only Bible parallel data, a bilingual dictionary, and source-side monolingual in-domain text are available—the simplest tested method wins. That method, DALI, replaces words in in-domain source sentences with dictionary translations to make pseudo-parallel data, then fine-tunes mBART on it. Across simulated low-resource languages and two domains, DALI reaches average ChrF 42.47 and BLEU 13.47, more than double the mBART baseline's 18.28 ChrF, and beats more complex methods (LeCA, CPT, and their combination). A small human evaluation on Polish government text shows DALI communicates meaning better than the baseline but still produces near-zero grammatical fluency, so the paper concludes the setting needs much better methods.

What carries the argument

The load-bearing mechanism is DALI's pseudo-parallel data construction: take monolingual in-domain sentences in the high-resource source language, replace content words with their target-language translations from a bilingual dictionary (keeping source word order), and treat the result as a parallel sentence pair. The dictionary itself matters almost as much: it is built by translating the 5000 most frequent lemmas with the Google Translate API and augmenting with a Fast Align lexicon induction over Bible verses. mBART is the shared backbone, fine-tuned on Bible data and then on mixed Bible and pseudo-parallel data for DALI.

What would settle it

Run the same DALI pipeline on a language absent from Google Translate and with no pre-existing bilingual dictionary, using only Bible-parallel data and a Fast Align induced lexicon; if DALI then fails to beat the mBART baseline or falls below CPT, the paper's central ranking collapses. A simpler check: replace the Google-Translate-built dictionary with one induced solely from the Bible corpus and measure whether the ChrF advantage over the baseline persists.

Watch

Extended reading notes

Core claim

The central claim is a comparative empirical result: in a realistic constrained setup for English-to-low-resource translation, the cheapest method is the best. DALI—which builds pseudo-parallel sentences by word-for-word dictionary replacement in target-domain source sentences and then trains on a mix of Bible verses and these synthetic sentences—outperforms mBART fine-tuned on Bible data alone, as well as the pointer-generator approach LeCA, continued pretraining CPT, and a combination of all three. The authors interpret this as evidence that data-level domain adaptation, not model modification, is currently the strongest lever in this setting, while also showing that no method comes close to usable quality.

Load-bearing premise

The approach assumes a usable bilingual dictionary exists for the low-resource language; here that dictionary is supplied largely by Google Translate, a system trained on abundant parallel data, so a truly low-resource language without such dictionary support could see DALI's gains vanish.

Editorial extensions

If this is right

  • In resource settings matching this one, teams should try dictionary-based forward-translation data augmentation before investing in more complex adaptation machinery.
  • The result provides a concrete benchmark for this under-explored setting: baseline mBART ChrF around 18, DALI around 42, with BLEU still in single-to-low-double digits.
  • Combining DALI with pretraining (CPT) or pointer-generators (LeCA) does not reliably beat DALI, suggesting the gains come from the pseudo-parallel data itself, not the extra model machinery.
  • The gap between automatic scores and human judgment—near-zero grammar scores—means current methods are not safe for real-world use in critical domains like medicine; the paper explicitly warns against this.
  • The approach is model-agnostic and only manipulates training data, so it can in principle be applied on top of other multilingual models besides mBART (though the paper only tests mBART).

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Because the dictionary is partly produced by Google Translate, a high-resource MT system, DALI's advantage may shrink for a truly low-resource language with no commercial MT coverage; re-testing the same pipeline in that harder condition would map how much the result depends on dictionary quality.
  • DALI preserves source word order and uses a single translation per word, so its outputs in morphologically rich languages are often ungrammatical; coupling DALI with a target-side reordering or morphological post-processing step is a plausible extension the paper does not explore.
  • The same pseudo-parallel recipe could be tested with dictionaries induced purely from the Bible corpus (no Google Translate) to see how performance degrades as dictionary coverage shrinks, giving practitioners a guide for when DALI stops being the best choice.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 6 minor

Summary. The paper studies domain adaptation (DA) for neural machine translation into low-resource languages, under the assumption that only three resources are available: a small out-of-domain parallel corpus (Bible verses), a bilingual dictionary, and source-side monolingual in-domain text. Using mBART fine-tuned on Bible data as the base model, the authors compare four adaptation methods: DALI (dictionary-based word-for-word replacement to create pseudo-parallel in-domain data), LeCA (lexical constraints via a pointer-generator), CPT (continued mixed-language pretraining on the source-side monolingual data), and a Combined method. Experiments are run on English-to-Croatian, Icelandic, Maltese, Polish, and Ukrainian for government and medical domains. The main claim, stated in the abstract and Section 5, is that the simplest method, DALI, is the most effective, more than doubling the average ChrF of the base model (42.47 vs. 18.28). A small human evaluation of Polish–government outputs indicates that, despite the gains, the translations are far from fluent or fully grammatical.

Significance. If the findings are reliable, this is a useful empirical contribution to an underexplored setting: domain adaptation for NMT at the intersection of low-resource translation and domain shift. The paper formulates a clear, realistic resource constraint, evaluates several established methods under the same backbone, and makes its code and data public. The main strength is the controlled comparison and the surprising, but plausible, result that a very simple data-manipulation method (DALI) outperforms more complex fine-tuning approaches (LeCA, CPT, Combined) in most conditions. This result, if robust, would give practitioners a practical, low-cost baseline to start from. However, the central ranking claim rests on two fragile supports: the quality of dictionaries built with Google Translate and the absence of any statistical reliability analysis. Both are acknowledged or visible in the manuscript, but they need to be addressed before the ranking can be considered established.

major comments (2)
  1. [§5, Table 1, and Appendix B] The central claim that DALI performs best on average is supported only by a single run per condition, as stated in Appendix B: "Each setting was trained once." No confidence intervals, significance tests, or bootstrap estimates are reported. This matters because the gap between DALI and Combined is small in several cells: Table 1 shows Maltese Med ChrF 48.77 vs. 48.88, Croatian Gov ChrF 38.87 vs. 39.93 (favoring Combined), and Ukrainian Gov ChrF 37.51 vs. 36.46. The average difference (42.47 vs. 41.92) is under one ChrF point. Without multiple seeds or a paired test, the ordering of DALI and Combined cannot be distinguished from run-to-run noise. The authors should either add at least three seeds per condition with variance reporting, or explicitly qualify the ranking as "reported without significance testing" and avoid naming DALI as the best method.
  2. [§3 (Dictionaries) and Limitations] The dictionary resource, which is load-bearing for DALI's pseudo-parallel data, is constructed by translating the 5000 most frequent English lemmas with the Google Translate API and augmenting with Fast Align on the Bible corpus. Google Translate is itself a high-resource MT system trained on large parallel corpora, so its availability for truly low-resource languages is not a given. The authors acknowledge this in the Limitations: "our dictionaries prepared with Google Translate only mimic target-domain dictionaries." However, this conditionality is not reflected in the abstract or Section 5, where DALI is recommended as the best starting point. The paper should either provide evidence that such high-quality bilingual dictionaries are commonly available in the target scenario, or include a sensitivity analysis (e.g., using a smaller or noisier dictionary, or a language not supported by Google Translate) to show how DALI's advantage degrades. Without this, the external validity of the main claim remains unestablished.
minor comments (6)
  1. [Abstract and §5] The phrase "ChrF score more than twice as high as the base model's" is technically correct but may overstate the result because the baseline is very low (18.28); consider reporting the absolute gap as well.
  2. [§3 (Dictionaries)] The text says "extract the 5000 most frequent lemmas and their inflections" but Table 4 reports dictionary sizes of 8k–10k; clarify whether the reported sizes include inflected forms and how many lemmas survive after augmentation.
  3. [Table 1 caption] The caption reads "Performance on the all the test sets"; it should be "on all the test sets".
  4. [§4 (Experimental Setup)] Typo: "decribed" should be "described".
  5. [Table 5 header] Typo: "max-spoch" should be "max-epoch".
  6. [Appendix A.1.2] The text has "seed = 42to" without a space; also, consider reporting the exact random seed used for data sampling.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: DALI's advantage is an empirical comparison on held-out test sets, with fixed hyperparameters and external method definitions; the dictionary limitation is an external-validity caveat, not a circular derivation.

full rationale

The paper's central claim is an empirical ranking of four domain-adaptation methods for low-resource NMT. No load-bearing step reduces to the paper's own inputs by construction. The test data are held-out sentence pairs from Tilde MODEL/WMT-style domain corpora (Section A.1.2), and the dictionary is built from Google Translate API plus FastAlign on Bible verses (Section 3), i.e., from resources external to the test set. DALI's pseudo-parallel data are generated by word-for-word replacement of source-side monolingual target-domain sentences, and the model is then evaluated on 1500 held-out pairs; there is no fitting to the test metric. Hyperparameters are fixed and identical across methods (Table 5), so the reported ranking is not a fitted-input-called-prediction artifact. The methods themselves are adopted from prior external work (Hu et al. 2019; Chen et al. 2021; Liu et al. 2021) and are not justified by self-citations; the authors do not cite their own prior work as load-bearing evidence. The limitations statement that the Google-Translate-built dictionaries 'only mimic target-domain dictionaries' is an honest external-validity caveat about resource availability in truly low-resource settings, not a circularity: it concerns whether the input resource would exist, not whether the derivation re-uses the target result. Similarly, the absence of significance testing and the single-run-per-setting protocol are correctness/robustness concerns, not circularity under the definitions used here. Overall, the derivation chain is self-contained relative to its stated assumptions, and the paper's conclusions are empirical rather than definitional.

Assumptions & free parameters 3 free parameters · 4 assumptions · 0 invented entities

This is an empirical paper, so the ledger records modeling choices and domain assumptions rather than free parameters in a derivation. The key choices are the dictionary size cap, the training-data cap, and the 1:1 mixing ratio; the key assumptions are mBART's transfer to unseen languages, dictionary quality, the validity of word-for-word substitution, and representativeness of test sets. No invented entities are introduced.

free parameters (3)
  • Dictionary lemma cap = 5000 lemmas (with inflections, final dictionaries 8k-10k entries)
    The authors choose the 5000 most frequent lemmas from the source-side monolingual data to translate via Google Translate; this threshold determines dictionary coverage and is chosen by hand.
  • Training data cap = 200K sentence pairs (seed 42)
    To maintain comparability across language/domain pairs, training and pretraining data are capped at 200K source sentences; for smaller corpora, all available sentences are used.
  • Pseudo-parallel to parallel batch ratio = 1:1 (equal number of instances per batch)
    Appendix B.2 specifies batches contain the same number of out-of-domain parallel and in-domain pseudo-parallel instances; this ratio is chosen without ablation.
assumptions (4)
  • domain assumption mBART, pretrained on 25 languages, provides a useful starting point for target languages not in its pretraining set (new language tokens are initialized randomly).
    The experimental design relies on this premise to simulate low-resource languages; if mBART generalization were poor, all compared methods would start from a weak base, though ranking might still hold.
  • domain assumption The Google Translate-derived bilingual dictionary (plus Fast Align on the Bible corpus) provides translation equivalents accurate enough for word-for-word pseudo-parallel data.
    DALI and Combined depend entirely on this dictionary; the authors note in Limitations that Google Translate dictionaries only 'mimic' true target-domain dictionaries.
  • domain assumption Word-for-word dictionary replacement of source sentences preserves enough of the source meaning for the resulting pseudo-parallel data to train a translation model.
    This is the core mechanism of DALI; the paper's own examples show morphologically and syntactically degenerate outputs, so the premise is that lexical overlap alone is enough to boost ChrF.
  • domain assumption The Tilde MODEL and WMT test sets are representative of the government and medical domains.
    Evaluation uses 1500 held-out sentence pairs per language/domain; if these test sets systematically differ from real-world target-domain text, the measured gains may not transfer.

how reviews work

0 comments
Cite this review

Pith. "Pith review of From Priest to Doctor: Domain Adaptation for Low-Resource Neural Machine Translation." pith.science (2026). https://pith.science/paper/24S5MXRJ

@misc{pith2026241200966,
  author       = {Pith},
  title        = {Pith review of: From Priest to Doctor: Domain Adaptation for Low-Resource Neural Machine Translation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/24S5MXRJ}},
  note         = {Machine review of arXiv:2412.00966}
}
read the original abstract

Many of the world's languages have insufficient data to train high-performing general neural machine translation (NMT) models, let alone domain-specific models, and often the only available parallel data are small amounts of religious texts. Hence, domain adaptation (DA) is a crucial issue faced by contemporary NMT and has, so far, been underexplored for low-resource languages. In this paper, we evaluate a set of methods from both low-resource NMT and DA in a realistic setting, in which we aim to translate between a high-resource and a low-resource language with access to only: a) parallel Bible data, b) a bilingual dictionary, and c) a monolingual target-domain corpus in the high-resource language. Our results show that the effectiveness of the tested methods varies, with the simplest one, DALI, being most effective. We follow up with a small human evaluation of DALI, which shows that there is still a need for more careful investigation of how to accomplish DA for low-resource NMT.

Figures

Figures reproduced from arXiv: 2412.00966 by the authors.

Figure 1
Figure 1. In our work, which looks at the (previously ne [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. The trend of averaged sentence-level BLEU (left) and ChrF (right) scores against the token length of the [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

47 extracted references · 16 canonical work pages

  1. [1]

    online" 'onlinestring :=

    ENTRY address archivePrefix author booktitle chapter edition editor eid eprint eprinttype howpublished institution journal key month note number organization pages publisher school series title type volume year doi pubmed url lastchecked label extra.label sort.label short.list INTEGERS output.state before.all mid.sentence after.sentence after.block STRING...

  2. [2]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION word.in bbl.in capitalize " " * FUNCT...

  3. [3]

    Farhad Akhbardeh, Arkady Arkhangorodsky, Magdalena Biesialska, Ond r ej Bojar, Rajen Chatterjee, Vishrav Chaudhary, Marta R. Costa-jussa, Cristina Espa \ n a-Bonet, Angela Fan, Christian Federmann, Markus Freitag, Yvette Graham, Roman Grundkiewicz, Barry Haddow, Leonie Harter, Kenneth Heafield, Christopher Homan, Matthias Huck, Kwabena Amponsah-Kaakyire, ...

    2021

  4. [4]

    Niyati Bafna, Philipp Koehn, and David Yarowsky. 2024. https://doi.org/10.18653/v1/2024.insights-1.9 Pointer-generator networks for low-resource machine translation: Don ' t copy that! In Proceedings of the Fifth Workshop on Insights from Negative Results in NLP, pages 60--72, Mexico City, Mexico. Association for Computational Linguistics

    work page doi:10.18653/v1/2024.insights-1.9 2024

  5. [5]

    Ankur Bapna and Orhan Firat. 2019. https://doi.org/10.18653/v1/D19-1165 Simple, scalable adaptation for neural machine translation . In Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP), pages 1538--1548, Hong Kong, China. Associat...

    doi:10.18653/v1/d19-1165 2019

  6. [6]

    Lo \" c Barrault, Magdalena Biesialska, Ond r ej Bojar, Marta R. Costa-juss \`a , Christian Federmann, Yvette Graham, Roman Grundkiewicz, Barry Haddow, Matthias Huck, Eric Joanis, Tom Kocmi, Philipp Koehn, Chi-kiu Lo, Nikola Ljube s i \'c , Christof Monz, Makoto Morishita, Masaaki Nagata, Toshiaki Nakazawa, Santanu Pal, Matt Post, and Marcos Zampieri. 202...

    2020

  7. [7]

    Toms Bergmanis and M \=a rcis Pinnis. 2021. https://doi.org/10.18653/v1/2021.eacl-main.271 Facilitating terminology translation with target lemma annotations . In Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume, pages 3105--3111, Online. Association for Computational Linguistics

    work page doi:10.18653/v1/2021.eacl-main.271 2021

  8. [8]

    Guanhua Chen, Yun Chen, Yong Wang, and Victor OK Li. 2021. Lexical-constraint-aware neural machine translation via data augmentation. In Proceedings of the Twenty-Ninth International Conference on International Joint Conferences on Artificial Intelligence, pages 3587--3593

    work page 2021

Show all 47 references
  1. [9]

    Mara Chinea-R \' os, \'A lvaro Peris, and Francisco Casacuberta. 2017. https://doi.org/10.18653/v1/W17-4714 Adapting neural machine translation with parallel synthetic data . In Proceedings of the Second Conference on Machine Translation, pages 138--147, Copenhagen, Denmark. A...

    2017 doi

  2. [10]

    Asa Cooper Stickland, Xian Li, and Marjan Ghazvininejad. 2021. https://doi.org/10.18653/v1/2021.eacl-main.301 Recipes for adapting pre-trained monolingual and multilingual models to machine translation . In Proceedings of the 16th Conference of the European Chapter of the Asso...

    2021 doi

  3. [11]

    Marta R Costa-juss \`a , James Cross, Onur C elebi, Maha Elbayad, Kenneth Heafield, Kevin Heffernan, Elahe Kalbassi, Janice Lam, Daniel Licht, Jean Maillard, et al. 2022. No language left behind: Scaling human-centered machine translation. arXiv preprint arXiv:2207.04672

    2022 arXiv

  4. [12]

    Zi-Yi Dou, Antonios Anastasopoulos, and Graham Neubig. 2020. https://doi.org/10.18653/v1/2020.emnlp-main.475 Dynamic data selection and weighting for iterative back-translation . In Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP),...

    2020 doi

  5. [13]

    Chris Dyer, Victor Chahuneau, and Noah A. Smith. 2013. https://aclanthology.org/N13-1073 A simple, fast, and effective reparameterization of IBM model 2 . In Proceedings of the 2013 Conference of the North A merican Chapter of the Association for Computational Linguistics: Hum...

    2013

  6. [14]

    Marzieh Fadaee and Christof Monz. 2018. https://doi.org/10.18653/v1/D18-1040 Back-translation sampling by targeting difficult words in neural machine translation . In Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, pages 436--446, Brusse...

    2018 doi

  7. [15]

    Marjan Ghazvininejad, Hila Gonen, and Luke Zettlemoyer. 2023. Dictionary-based phrase-level prompting of large language models for machine translation. arXiv preprint arXiv:2302.07856

    2023 arXiv

  8. [16]

    Junjie Hu, Mengzhou Xia, Graham Neubig, and Jaime Carbonell. 2019. https://doi.org/10.18653/v1/P19-1286 Domain adaptation of neural machine translation by lexicon induction . In Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, pages 2989...

    2019 doi

  9. [17]

    Di Jin, Zhijing Jin, Joey Tianyi Zhou, and Peter Szolovits. 2020. A simple baseline to semi-supervised domain adaptation for machine translation. arXiv preprint arXiv:2001.08140

    2020 arXiv

  10. [18]

    Pratik Joshi, Sebastin Santy, Amar Budhiraja, Kalika Bali, and Monojit Choudhury. 2020. The state and fate of linguistic diversity and inclusion in the nlp world. arXiv preprint arXiv:2004.09095

    2020 arXiv

  11. [19]

    Catherine Kobus, Josep Crego, and Jean Senellart. 2017. https://doi.org/10.26615/978-954-452-049-6_049 Domain control for neural machine translation . In Proceedings of the International Conference Recent Advances in Natural Language Processing, RANLP 2017 , pages 372--378, Va...

    2017 doi

  12. [20]

    Tom Kocmi, Eleftherios Avramidis, Rachel Bawden, Ond r ej Bojar, Anton Dvorkovich, Christian Federmann, Mark Fishel, Markus Freitag, Thamme Gowda, Roman Grundkiewicz, Barry Haddow, Philipp Koehn, Benjamin Marie, Christof Monz, Makoto Morishita, Kenton Murray, Makoto Nagata, To...

    2023 doi

  13. [21]

    Tom Kocmi, Rachel Bawden, Ond r ej Bojar, Anton Dvorkovich, Christian Federmann, Mark Fishel, Thamme Gowda, Yvette Graham, Roman Grundkiewicz, Barry Haddow, Rebecca Knowles, Philipp Koehn, Christof Monz, Makoto Morishita, Masaaki Nagata, Toshiaki Nakazawa, Michal Nov \'a k, Ma...

    2022

  14. [22]

    Tom Kocmi and Ond r ej Bojar. 2020. https://aclanthology.org/2020.eamt-1.3 Efficiently reusing old models across languages via transfer learning . In Proceedings of the 22nd Annual Conference of the European Association for Machine Translation, pages 19--28, Lisboa, Portugal. ...

    2020

  15. [23]

    Philipp Koehn and Rebecca Knowles. 2017. https://doi.org/10.18653/v1/W17-3204 Six challenges for neural machine translation . In Proceedings of the First Workshop on Neural Machine Translation, pages 28--39, Vancouver. Association for Computational Linguistics

    2017 doi

  16. [24]

    Yinhan Liu, Jiatao Gu, Naman Goyal, Xian Li, Sergey Edunov, Marjan Ghazvininejad, Mike Lewis, and Luke Zettlemoyer. 2020. https://doi.org/10.1162/tacl_a_00343 Multilingual denoising pre-training for neural machine translation . Transactions of the Association for Computational...

    2020 doi

  17. [25]

    Zihan Liu, Genta Indra Winata, and Pascale Fung. 2021. https://doi.org/10.18653/v1/2021.findings-acl.239 Continual mixed-language pre-training for extremely low-resource neural machine translation . In Findings of the Association for Computational Linguistics: ACL-IJCNLP 2021,...

    2021 doi

  18. [26]

    Mieradilijiang Maimaiti, Yang Liu, Huanbo Luan, and Maosong Sun. 2019. https://doi.org/10.1145/3314945 Multi-round transfer learning for low-resource nmt using multiple high-resource languages . ACM Trans. Asian Low-Resour. Lang. Inf. Process., 18(4)

    2019 doi

  19. [27]

    Zhibo Man, Zengcheng Huang, Yujie Zhang, Yu Li, Yuanmeng Chen, Yufeng Chen, and Jinan Xu. 2023. Wdsrl: Multi-domain neural machine translation with word-level domain-sensitive representation learning. IEEE/ACM Transactions on Audio, Speech, and Language Processing, 32:577--590

    2023

  20. [28]

    McCarthy, Rachel Wicks, Dylan Lewis, Aaron Mueller, Winston Wu, Oliver Adams, Garrett Nicolai, Matt Post, and David Yarowsky

    Arya D. McCarthy, Rachel Wicks, Dylan Lewis, Aaron Mueller, Winston Wu, Oliver Adams, Garrett Nicolai, Matt Post, and David Yarowsky. 2020. https://aclanthology.org/2020.lrec-1.352 The J ohns H opkins U niversity B ible corpus: 1600+ tongues for typological exploration . In Pr...

    2020

  21. [29]

    Sreyashi Nag, Mihir Kale, Varun Lakshminarasimhan, and Swapnil Singhavi. 2020. Incorporating bilingual dictionaries for low resource semi-supervised neural machine translation. arXiv preprint arXiv:2004.02071

    2020 arXiv

  22. [30]

    Kishore Papineni, Salim Roukos, Todd Ward, and Wei-Jing Zhu. 2002. https://doi.org/10.3115/1073083.1073135 B leu: a method for automatic evaluation of machine translation . In Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics, pages 311--3...

    2002

  23. [31]

    Wei Peng, Chongxuan Huang, Tianhao Li, Yun Chen, and Qun Liu. 2020. Dictionary-based data augmentation for cross-domain neural machine translation. arXiv preprint arXiv:2004.02577

    2020 arXiv

  24. [32]

    MinhQuang Pham, Josep Crego, Fran c ois Yvon, and Jean Senellart. 2019. https://aclanthology.org/2019.iwslt-1.26 Generic and specialized word embeddings for multi-domain machine translation . In Proceedings of the 16th International Conference on Spoken Language Translation, H...

    2019

  25. [33]

    Alberto Poncelas, Gideon Maillette de Buy Wenniger, and Andy Way. 2019. Adaptation of machine translation models with back-translated data using transductive data selection methods. In International Conference on Computational Linguistics and Intelligent Text Processing, pages...

    2019

  26. [34]

    Maja Popovi \'c . 2015. https://doi.org/10.18653/v1/W15-3049 chr F : character n-gram F -score for automatic MT evaluation . In Proceedings of the Tenth Workshop on Statistical Machine Translation, pages 392--395, Lisbon, Portugal. Association for Computational Linguistics

    2015 doi

  27. [35]

    Matt Post. 2018. https://doi.org/10.18653/v1/W18-6319 A call for clarity in reporting BLEU scores . In Proceedings of the Third Conference on Machine Translation: Research Papers, pages 186--191, Brussels, Belgium. Association for Computational Linguistics

    2018 doi

  28. [36]

    Surangika Ranathunga, En-Shiun Annie Lee, Marjana Prifti Skenduli, Ravi Shekhar, Mehreen Alam, and Rishemjit Kaur. 2023. https://doi.org/10.1145/3567592 Neural machine translation for low-resource languages: A survey . ACM Comput. Surv., 55(11)

    2023 doi

  29. [37]

    Mortensen, and Graham Neubig

    Nathaniel Robinson, Perez Ogayo, David R. Mortensen, and Graham Neubig. 2023. https://doi.org/10.18653/v1/2023.wmt-1.40 C hat GPT MT : Competitive for high- (but not low-) resource languages . In Proceedings of the Eighth Conference on Machine Translation, pages 392--418, Sing...

    2023 doi

  30. [38]

    Roberts Rozis and Raivis Skadi n s . 2017. https://aclanthology.org/W17-0235 Tilde MODEL - multilingual open data for EU languages . In Proceedings of the 21st Nordic Conference on Computational Linguistics, pages 263--265, Gothenburg, Sweden. Association for Computational Linguistics

    2017

  31. [39]

    Shoetsu Sato, Jin Sakuma, Naoki Yoshinaga, Masashi Toyoda, and Masaru Kitsuregawa. 2020. https://doi.org/10.18653/v1/2020.findings-emnlp.381 Vocabulary adaptation for domain adaptation in neural machine translation . In Findings of the Association for Computational Linguistics...

    2020 doi

  32. [40]

    Danielle Saunders. 2022. Domain adaptation and multi-domain adaptation for neural machine translation: A survey. Journal of Artificial Intelligence Research, 75:351--424

    2022

  33. [41]

    Rico Sennrich, Barry Haddow, and Alexandra Birch. 2016. https://doi.org/10.18653/v1/P16-1009 Improving neural machine translation models with monolingual data . In Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), ...

    2016 doi

  34. [42]

    Aditya Siddhant, Ankur Bapna, Orhan Firat, Yuan Cao, Mia Xu Chen, Isaac Caswell, and Xavier Garcia. 2022. Towards the next 1000 languages in multilingual machine translation: Exploring the synergy between supervised and self-supervised learning. arXiv preprint arXiv:2201.03110

    2022 arXiv

  35. [43]

    Emmanouil Stergiadis, Satendra Kumar, Fedor Kovalev, and Pavel Levin. 2021. https://aclanthology.org/2021.mtsummit-up.27 Multi-domain adaptation in neural machine translation through multidimensional tagging . In Proceedings of Machine Translation Summit XVIII: Users and Provi...

    2021

  36. [44]

    Vaibhav Vaibhav, Sumeet Singh, Craig Stewart, and Graham Neubig. 2019. https://doi.org/10.18653/v1/N19-1190 Improving robustness of machine translation with synthetic noise . In Proceedings of the 2019 Conference of the North A merican Chapter of the Association for Computatio...

    2019 doi

  37. [45]

    Rui Wang, Xu Tan, Renqian Luo, Tao Qin, and Tie-Yan Liu. 2021. A survey on low-resource neural machine translation. arXiv preprint arXiv:2107.04239

    2021 arXiv

  38. [46]

    Chen Zhang, Xiao Liu, Jiuheng Lin, and Yansong Feng. 2024. Teaching large language models an unseen language on the fly. arXiv preprint arXiv:2402.19167

    2024 arXiv

  39. [47]

    Hongxiao Zhang, Hui Huang, Jiale Gao, Yufeng Chen, Jinan Xu, and Jian Liu. 2022. https://aclanthology.org/2022.coling-1.448 Iterative constrained back-translation for unsupervised domain adaptation of machine translation . In Proceedings of the 29th International Conference on...

    2022

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.