Arabic Dialect Handling in Hybrid Machine Translation
Paper · 2010 · Hassan Sawaf
Summary
The paper addresses a weakness of Arabic machine translation: systems trained on Modern Standard Arabic (MSA) struggle with dialectal, spontaneous and noisy input from broadcast transcripts and web text. Sawaf adds a dialect normalization stage to a hybrid MT (HMT) system. The hybrid core combines a Lexical Functional Grammar (LFG) rule-based engine with a phrase-based statistical decoder in a log-linear framework, where c-structure, f-structure, POS and semantic attributes all act as features.
The normalizer treats dialect-to-MSA conversion as a mostly monotone translation with local reordering. It has two parts. A dialect analysis model proposes candidate MSA words and phrases, using hand-written character rules plus rules learned with GIZA++ from bi-dialectal parallel corpora. An MSA language model then scores those candidates in context.
Normalization improved BLEU for the rule-based, statistical and hybrid systems alike. The gain was largest when both training and test data were normalized: about 1 point absolute on broadcast data and about 2 points on web data. The work shows that bringing nonstandard input into the variety a model was trained on is a cheap, model-agnostic gain.
Key points
- Dialect normalization BLEU gains (Table 3):
- LFG: 18.1% → 19.5%
- SMT: 35.4% → 36.4%
- HMT: 37.3% → 38.5%
- Train/test normalization (Table 4, HMT):
- Broadcast: 35.5% baseline, 35.9% with test-only normalization, 36.4% with train and test normalized.
- Web (NIST MT08 WB portion): 39.9% baseline, 40.5% with test-only normalization, 42.1% with train and test normalized.
- Normalizer training data: bi-dialectal corpora of 271K sentences (3.1M words) for broadcast and 1.6M sentences (28M words) for web. Dev sets have 5K and 8K sentences. A separate model is trained per dialect.
- Broadcast test set: collected by a provider in the UAE. It mixes newscasts, interviews, films and TV shows so that nearly all regional dialects appear. Table 5 gives an Iraqi Colloquial Arabic example.
- Morphological segmentation: shrinks a vocabulary of more than 600K words by up to 70%, to 256K morpheme units, which reduces unknown words.
Interesting ideas
- I1. Rather than teaching the main system every dialect, rewrite nonstandard input into the standard variety first, using a translation-style search with a strong standard-language model as judge. This isolates dialect variation in one swappable module.
- I2. Running the normalizer over the training corpus as well as the test input gave a much bigger gain than normalizing test input alone, because the model's statistics and its inputs then live in the same space.
- I3. The rewrite rules are induced from a corpus in which the same sentence appears in two varieties, using ordinary word alignment and phrase extraction.
- I4. Hybridization is framed as smoothing: hand rules should win where training statistics are sparse or long-distance structure matters, and statistics should win where data are dense.
- I5. The author notes that a strong target language model can silently drop low-frequency but critical words such as negations. Losing such a word damages "informativeness" far more than its BLEU cost suggests.
For Mova
How these ideas could serve Mova, our small open language model — its files, stages and tests:
- I1 (tokens): a pre-tagging normalizer could map informal or regional English spellings to standard forms, keeping each rewrite logged so the step stays explainable.
- I2 (learn): any normalization applied at inference should also be run over treebanks and silver data before training, with a test-only run kept as a control.
- I3 (learn): pairs of the same sentence in two varieties or registers could be aligned to induce repair or conversion rules automatically.
- I4 (tree): rule-derived signals could enter the perceptron parser as weighted features that dominate only for rare constructions.
- I5 (back): the text → graph → text compressor and the generator should explicitly check that negation and key content nodes survive the round trip.
Fields, topics and concepts
📚 Shelves 4The field of science this work belongs to (OpenAlex fields).Computer Science · 18,614 worksArtificial Intelligence · 17,965 worksArts and Humanities · 17,450 worksLanguage and Linguistics · 17,296 works
🧭 Topics 2Research subjects and languages the work is about.Machine translation · 1,105 worksSemitic languages · 3,066 works
Cite
Cite as Hassan Sawaf. 2010. Arabic Dialect Handling in Hybrid Machine Translation. Proceedings of the 9th Conference of the Association for Machine Translation in the Americas: Research Papers.
@inproceedings{sawaf2010arabic,
title = {{Arabic Dialect Handling in Hybrid Machine Translation}},
author = {Hassan Sawaf},
booktitle = {Proceedings of the 9th Conference of the Association for Machine Translation in the Americas: Research Papers},
year = {2010},
url = {https://aclanthology.org/2010.amta-papers.5/}
}References
- Y. Al-Onaizan, Jan Curin, M. Jahr, K. Knight, J. Lafferty, I. D. Melamed, F. J. Och, D. Purdy, N. A. Smith, and D. Yarowsky. 1999. "Statistical Machine Translation: Final Report," Johns Hopkins University 1999 Summer Workshop on Language Engineering, Center for Language and Speech Processing, Baltimore, MD. find
- P. Brown, J. Cocke, S. Della Pietra, V. Della Pietra, F. Jelinek, J. Lafferty, R. Mercer, and P. Roosin. 1990. A Statistical Approach to Machine Translation. Computational Linguistics, 16, pp. 79–85. Cambridge, MA. ↗
- P. Brown, S. Della Pietra, V. Della Pietra, and R. Mercer. 1993. The Mathematics of Statistical Machine Translation: Parameter Estimation. Computational Linguistics, 19(2), pp. 263–311. Cambridge, MA. find
- E. Charniak, K. Knight, and K. Yamada. 2003. Syntax-Based Language Models for Statistical Machine Translation. In Proceedings of MT Summit IX, pp. 23–27. New Orleans, LA. find
- R. Kaplan and J. Bresnan. 1982. Lexical-Functional Grammar: A Formal System for Grammatical Representation. In The Mental Representation of Grammatical Relations, pp. 173–281. MIT Press. find
- R. Kneser, and H. Ney. 1995. Improved backing-off for m-gram language modeling. Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, volume 1. pp. 181–184. find
- P. Koehn, H. Hoang, A. Birch, C. Callison-Burch, M. Federico, N. Bertoldi, B. Cowan, W. Shen, C. Moran, R. Zens, C. Dyer, O. Bojar, A Constantin, E. Herbst. 2007. Moses: Open Source Toolkit for Statistical Machine Translation, Annual Meeting of the Association for Computational Linguistics (ACL), demonstration session, Prague, Czech Republic. find
- S. Köpru and J. Miller. 2009. A Unification Based Approach to the Morphological Analysis and Generation of Arabic. CAASL3: Proc. of the 3rd Workshop on Computational Approaches to Arabic-script based Languages. Ottawa, ON, Canada.
- F. J. Och, and H. Ney. 2002. Discriminative Training and Maximum Entropy Models for Statistical Machine Translation. In Proceedings of the Ninth Machine Translation Summit, pp. 295–302. New Orleans, LA.
- F. J. Och, and H. Ney. 2004. The Alignment Template Approach to Statistical Machine Translation. In Computational Linguistics, 30(4), pp. 417–449. Cambridge, MA. ↗
- K. Papineni, S. Roukos, T. Ward, and W.-J. Zhu. 2002. BLEU: a method for automatic evaluation of machine translation. In Proceedings of the 40th Annual Meeting of the Association for the Computational Linguistics, pp. 311–318. Philadelphia, PA.
- H. Sawaf, K. Schütz, and H. Ney. 2000. On the Use of Grammar-Based Language Models for Statistical Machine Translation. In Proceedings of the Sixth International Workshop on Parsing Technologies (IWPT), pp. 231–241. Trento, Italy. find
- M. Shihadah, P. Roochnik. 1998. Lexical-Functional Grammar as a Computational-Linguistic Underpinning to Arabic Machine Translation. In Proceedings of the 6th International Conference and Exhibition on Multi-lingual Computing. Cambridge, UK. find
Updated
This page in Markdown → https://md.research.elamur.ai/free/en/papers/sawaf-2010-arabic-dialect-handling-hybrid-machine/