CoChat

An Empirical Comparison of Domain Adaptation Methods for Neural Machine Translation

Open access
Chu, Chenhui, Dabre, Raj, Kurohashi, Sadao · 2017 · Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers)

The DOI matches its Crossref record; 25 of the 28 references it cites were found in a registry or an index.

Abstract

In this paper, we propose a novel domain adaptation method named "mixed fine tuning" for neural machine translation (NMT).We combine two existing approaches namely fine tuning and multi domain NMT.We first train an NMT model on an out-of-domain parallel corpus, and then fine tune it on a parallel corpus which is a mix of the in-domain and out-ofdomain corpora.All corpora are augmented with artificial tags to indicate specific domains.We empirically compare our proposed method against fine tuning and multi domain methods and discuss its benefits and shortcomings.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.18653/v1/p17-2061

Cites

25 of 25 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1 Fine tuning for domain adaptation.
Figure 1 Fine tuning for domain adaptation.CC-BY · From the PDF
Figure 2 Mixed fine tuning with domain tags for domain adaptation (The section in the dotted rectangle denotes the multi domain method).
Figure 2 Mixed fine tuning with domain tags for domain adaptation (The section in the dotted rectangle denotes the multi domain method).CC-BY · From the PDF

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

  • Learning Phrase Representations using RNN Encoder–Decoder for Statistical Machine Translation

    Cho, K., van Merrienboer, B., Gulcehre, C., Bahdanau, D., Bougares, F., Schwenk, H., & Bengio, Y. (2014) · Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/v1/d14-1179 · Cited by 25,545 · cited 2×

    “One of the most attractive features of neural machine translation (NMT) (Bahdanau et al., 2015; Cho et al., 2014; Sutskever et al., 2014) is that it is possible to train an end to end system without the need to deal with word alignments, translation rules and complicated decoding algorithms, which are a characteristic…”
    Background
  • Sequence to Sequence Learning with Neural Networks

    Sutskever, I., Vinyals, O., & Le, Q. V. (2014) · arXiv · doi:10.48550/arxiv.1409.3215 · Cited by 17,766 · cited 1×

    “One of the most attractive features of neural machine translation (NMT) (Bahdanau et al., 2015; Cho et al., 2014; Sutskever et al., 2014) is that it is possible to train an end to end system without the need to deal with word alignments, translation rules and complicated decoding algorithms, which…”
    Background
  • Neural Machine Translation by Jointly Learning to Align and Translate

    Bahdanau, D., Cho, K., & Bengio, Y. (2014) · arXiv · doi:10.48550/arxiv.1409.0473 · Cited by 16,213 · cited 2×

    “One of the most attractive features of neural machine translation (NMT) (Bahdanau et al., 2015; Cho et al., 2014; Sutskever et al., 2014) is that it is possible to train an end to end system without the need to deal with word alignments, translation rules and complicated decoding algorithms, which are a characteristic…”
    Background
  • Moses: open source toolkit for statistical machine translation

    Koehn, P., Zens, R., Dyer, C., Bojar, O., Constantin, A., Herbst, E., Hoang, H., Birch, A., Callison-Burch, C., Federico, M., et al. (2007) · Proceedings of the 45th Annual Meeting of the ACL on Interactive Poster and Demonstration Sessions - ACL '07 · doi:10.3115/1557769.1557821 · Cited by 4,735 · cited 1×

    “We used the Moses PBSMT system (Koehn et al., 2007) for all of our MT experiments.”
    Method
  • Minimum error rate training in statistical machine translation

    Och, F. J. (2003) · Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - ACL '03 · doi:10.3115/1075096.1075117 · Cited by 2,725 · cited 1×

    “In all of our experiments, we used the GIZA++ toolkit 7 for word alignment; tuning was performed by minimum error rate training (Och, 2003), and it was re-run for every experiment.”
    Method
  • Statistical Significance Tests for Machine Translation Evaluation.

    Koehn, P. (2004) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · Cited by 2,165

  • Google’s Multilingual Neural Machine Translation System: Enabling Zero-Shot Translation

    Johnson, M., Schuster, M., Le, Q. V., Krikun, M., Wu, Y., Chen, Z., Thorat, N., Viégas, F., Wattenberg, M., Corrado, G., et al. (2017) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00065 · Cited by 1,747 · cited 1×

    “Tag based NMT has also been shown to be effective for control the politeness of translations (Sennrich et al., 2016a) and multilingual NMT (Johnson et al., 2016).”
    Background
  • Moses : open source toolkit for statistical machine translation

    Koehn, P., Hoang, H., Birch, A., Callison-Burch, C., Federico, M., Bertoldi, N., Cowan, B., Shen, W., Moran, C., Zens, R., et al. (2007) · Edinburgh Research Explorer (University of Edinburgh) · Cited by 1,547

  • Transfer Learning for Low-Resource Neural Machine Translation

    Zoph, B., Yuret, D., May, J., & Knight, K. (2016) · Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d16-1163 · Cited by 788 · cited 8×

    “However, it is reported that NMT works better than SMT only when there is an abundance of parallel corpora.”
    BackgroundInfluential
  • On Using Monolingual Corpora in Neural Machine Translation

    Gülçehre, Ç., Fırat, O., Xu, K., Cho, K., Barrault, L., Lin, H.-C., Bougares, F., Schwenk, H., & Bengio, Y. (2015) · HAL (Le Centre pour la Communication Scientifique Directe) · doi:10.48550/arxiv.1503.03535 · Cited by 466 · cited 2×

    “Either training an in-domain recurrent neural network (RNN) language model for the NMT decoder (Gülçehre et al., 2015) or generating synthetic data by back translating target in-domain monolingual data (Sennrich et al., 2016b) have been studied.”
    BackgroundMethod

Show all 25 references

Research works printed but not linked: 4

  1. [6]6. Fabien Cromieres, Chenhui Chu, Toshiaki Nakazawa, and Sadao Kurohashi. 2016. Kyoto univer- sity participation to wat 2016. In Proceed- ings of the 3rd Workshop on Asian Transla- tion (WAT2016). The COLING 2016 Organiz- ing Committee, Osaka, Japan, pages 166-174. http://aclweb.org/anthology/W16-4616.
  2. [14]14. Sadao Kurohashi, Toshihisa Nakamura, Yuji Mat- sumoto, and Makoto Nagao. 1994. Improvements of Japanese morphological analyzer JUMAN. In Pro- ceedings of the International Workshop on Sharable Natural Language. pages 22-28.
  3. [21]21. Rico Sennrich, Barry Haddow, and Alexandra Birch. 2016b. Improving neural machine translation models with monolingual data. In Proceed- ings of the 54th Annual Meeting of the As- sociation for Computational Linguistics (Volume 1: Long Papers). Association for Computa- tional Linguistics, Berlin, Germany, pages 86-96. http://www.aclweb.org/anthology/P16-1009.
  4. [22]22. Rico Sennrich, Barry Haddow, and Alexandra Birch. 2016c. Neural machine translation of rare words with subword units. In Proceed- ings of the 54th Annual Meeting of the As- sociation for Computational Linguistics (Volume 1: Long Papers). Association for Computational Linguistics, Berlin, Germany, pages 1715-1725. http://www.aclweb.org/anthology/P16-1162.

Cited by

See all 251

Metadata

Authors
Chu, C., Dabre, R., & Kurohashi, S.
Affiliations
  • The University of Osaka (JP)
  • Kyoto University (JP)
Corresponding author
Chu, Chenhui
Venue
Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers)
Published
2017
Pages
385-391
ISSN
0736-587X (ISSN-L)
OpenAlex
W2744813330
Cited by
215
References
28
Citations by year
2025: 15 · 2024: 15 · 2023: 21 · 2022: 21 · 2021: 27 · 2020: 41 · 2019: 39 · 2018: 27 · 2017: 9
FWCI
14.47
Type
conference paper
Language
en
Open access
Licence
cc-by
Locations
Proceedings of the conference - Association for Computational Linguistics. Meeting (publishedVersion, cc-by)
Funders
  • Department of Science and Technology, Ministry of Science and Technology, India
  • Japan Society for the Promotion of Science
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
Keywords
domain adaptation, neural machine translation, fine-tuning

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: An Empirical Comparison of Domain Adaptation Methods for Neural Machine Translation. https://app.cochat.ai/papers/10.18653/v1/p17-2061
The paper
Chu, C., Dabre, R., & Kurohashi, S. (2017). An Empirical Comparison of Domain Adaptation Methods for Neural Machine Translation. Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers). https://doi.org/10.18653/v1/p17-2061

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.