Domain Adaptation for Machine Translation by Mining Unseen Words
Paper · 2011 · Hal Daumé III and Jagadeesh Jagarlamudi
Summary
The paper looks at why statistical MT trained on parliamentary text performs poorly in new domains, and isolates one cause: source words never seen in training. Europarl serves as the parallel source domain. Four target domains (News, Emea, Subs, PHP) are tested for German→English and French→English, using only comparable target-domain text plus small tuning and test sets. Oracle experiments show that unseen words cause about half of the extra error in most domains. News is the exception, since its vocabulary barely differs from Europarl. The authors extend the CCA-based lexicon induction of Haghighi et al. (2008), seeding it with Europarl translations of frequent target-domain words, and mine candidate translations for out-of-vocabulary terms. Simply adding mined pairs to a Moses-style phrase table gives little benefit. Adding them with dedicated features yields steady improvements, with the largest on Emea (about 1.5 Bleu). Overall, the method closes roughly half the gap between the baseline and an upper bound limited to OOV words. This shows that cheap comparable data can repair vocabulary gaps during domain adaptation.
Key points
- Data: Europarl (996k sentences) is the source domain. Target corpora are News Commentary and three OPUS sets: Emea, Open Subtitles, and PHP documentation.
- Comparable data was simulated by pairing the first half of the English side with the second half of the foreign side.
- OOV rates: The share of target-domain words unseen in Europarl is 17% for News, 49% for Emea, 44% for PHP and 68% for Subs.
- Mining pipeline:
- About 5000 frequent words per language are used.
- Each word gets context features (window of 5, words truncated to 7 characters, top 2000 features, TFIDF, binarized) and orthographic 1–3-gram features. These are combined as linear kernels and reduced with incomplete Cholesky.
- The seed pairs come from a Hungarian-algorithm matching over Europarl translation probabilities.
- CCA keeps the top 35% of eigenvectors and returns 5 candidates per OOV word.
- Native speakers judged 8 of 10 sampled words correctly translated.
- Oracles: Training on target-domain parallel data improves Emea Bleu by 73% relative. The upper bound from fixing only OOV words is about halfway between the baseline and the full oracle.
- Results:
- German Emea Bleu rose from 26.62 to 28.06.
- Gains in Subs and PHP were smaller but positive.
- The system used two trigram LMs (Gigaword plus target-domain English) and MERT averaged over three runs.
Interesting ideas
- I1. Separate features for mined entries. Mined pairs get their own probability feature, with seen-in-source and seen-in-target indicators and their conjunction. Their ordinary phrase probabilities are set to zero. Only the full set of four features helped, so the tuner needs to weight mined and real entries independently. This applies to any case of merging a noisy lexicon into an existing model.
- I2. Diagnose with a restricted oracle first. Remove from the oracle only the phrases involving unseen words. This estimates how much a vocabulary fix could ever gain before any work goes into it. It is a reusable way to budget effort on a domain-shift problem.
- I3. Bootstrap from the source domain. Frequent target-domain words that already have Europarl translations become CCA training pairs. No hand-built seed dictionary is needed, which makes the approach attractive for language pairs with few resources.
- I4. Compare orthography through kernels. Character n-grams are turned into within-language similarity kernels rather than compared as raw features across languages. The authors argue this keeps orthographic cues usable even when the two languages use different scripts.
- I5. One-to-one seeds via bipartite matching. Many-to-many translation probabilities are reduced to a one-to-one seed set with maximum weighted bipartite matching. This is a simple fix for any method that expects a single partner per item.
Fields, topics and concepts
📚 Shelves 2The field of science this work belongs to (OpenAlex fields).Computer Science · 16,667 worksArtificial Intelligence · 16,194 works
🧭 Topics 1Research subjects and languages the work is about.Machine translation · 1,087 works
Cite
Cite as Hal Daumé III and Jagadeesh Jagarlamudi. 2011. Domain Adaptation for Machine Translation by Mining Unseen Words. Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies.
@inproceedings{iii2011domain,
title = {{Domain Adaptation for Machine Translation by Mining Unseen Words}},
author = {Hal Daumé III and Jagadeesh Jagarlamudi},
booktitle = {Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies},
year = {2011},
url = {https://aclanthology.org/P11-2071/}
}References
- Satanjeev Banerjee and Alon Lavie. 2005. Meteor: An automatic metric for MT evaluation with improved correlation with human judgments. In In Proceedings of Workshop on Intrinsic and Extrinsic Evaluation Measures for MT and/or Summarization at ACL.
- Nicola Bertoldi and Marcello Federico. 2009. Domain adaptation for statistical machine translation with monolingual resources. In StatMT ’09: Proceedings of the Fourth Workshop on Statistical Machine Translation.
- John Blitzer and Hal Daumé III. 2010. Domain adaptation. Tutorial at the International Conference on Machine Learning, http://adaptationtutorial.blitzer.com/. ↗
- Jorge Civera and Alfons Juan. 2007. Domain adaptation in statistical machine translation with mixture modelling. In StatMT ’07: Proceedings of the Second Workshop on Statistical Machine Translation. find
- Aria Haghighi, Percy Liang, Taylor Berg-Kirkpatrick, and Dan Klein. 2008. Learning bilingual lexicons from monolingual corpora. In Proceedings of the Conference of the Association for Computational Linguistics (ACL).
- Almut Silja Hildebrand, Matthias Eck, Stephan Vogel, and Alex Waibel. 2005. Adaptation of the translation model for statistical machine translation based on information retrieval. In European Association for Machine Translation.
- H. Hotelling. 1936. Relation between two sets of variables. Biometrica, 28:322–377. find
- J. Jiang. 2008. A literature survey on domain adaptation of statistical classifiers. Available at http://sifaka.cs.uiuc.edu/jiang4/domain_adaptation/survey. ↗
- R. Jonker and A. Volgenant. 1987. A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing, 38(4):325–340. find
- Philipp Koehn and Josh Schroeder. 2007. Experiments in domain adaptation for statistical machine translation. In StatMT ’07: Proceedings of the Second Workshop on Statistical Machine Translation.
- Philipp Koehn, Hieu Hoang, Alexandra Birch, Chris Callison-Burch, Marcello Federico, Nicola Bertoldi, Brooke Cowan, Wade Shen, Christine Moran, Richard Zens, Chris Dyer, Ondrej Bojar, Alexandra Constantin, and Evan Herbst. 2007. Moses: Open source toolkit for statistical machine translation. In Proc… find
- Franz Josef Och. 2003. Minimum error rate training for statistical machine translation. In Proceedings of the Conference of the Association for Computational Linguistics (ACL), Sapporo, Japan, July. find
- Kishore Papineni, Salim Roukos, Todd Ward, and Wei-Jing Zhu. 2002. Bleu: a method for automatic evaluation of machine translation. In Proceedings of the Conference of the Association for Computational Linguistics (ACL), pages 311–318.
- Matthew Snover, Bonnie Dorr, and Richard Schwartz. 2008. Language and translation model adaptation using comparable corpora. In Proceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP). find
Updated
This page in Markdown → https://md.research.elamur.ai/free/en/papers/iii-2011-domain-adaptation-machine-translation-mining/