Diacritization for Real-World Arabic Texts
Paper · 2009 · Emad Mohamed and Sandra Kübler
Summary
Arabic is usually written without short vowels, so one written form can correspond to words with different meanings and parts of speech. Restoring these diacritics helps downstream tasks such as machine translation. The authors treat diacritization as a character-level classification task. For each letter, the system decides which short vowel follows it: none, a vowel, or a shadda combination. The features are a window of neighboring characters plus up to five surrounding words, and the classifier is the memory-based learner TiMBL. Trained on the Penn Arabic Treebank (ATB), the system is competitive with Zitouni et al. even though it uses no linguistic preprocessing. Performance drops on real web text, mainly because sites such as AFP write the hamza inconsistently or omit it, while the treebank spells it carefully. Adding a separate TiMBL-based hamza restoration step before diacritization lowers WER from 9.20% to 7.38% on treebank data. On four human-rated AFP news stories, it lowers WER from 7.96% to 5.93%. The main lesson is that orthographic gaps between clean training corpora and real text must be bridged explicitly.
Key points
- Task definition: each character gets a class (short vowel, shadda plus vowel, or no vowel). Case endings, mood endings, nunation and hamza are left out of the diacritization target.
- Features and model: the features are the focus character, 5 characters on each side, and 5 whole words on each side. The model is TiMBL (k-nearest-neighbor, feature weighting by gain ratio / information gain).
- Data:
- ATB parts 1 and 2 (about 170k AFP words plus about 160k Ummah words), evaluated with 10-fold CV.
- ATB part 3 (An Nahar, about 288k train / 52k devtest), used for comparison with Zitouni et al.
- An AFP-only 90/10 split, used for the hamza experiments.
- Treebank results with restored hamza: CER 2.54% and WER 7.38% with punctuation; CER 2.83% and WER 13.66% without punctuation. These are close to the setting where both training and test data have perfect hamza.
- Real-world test: four AFP stories from 2 Dec 2008 (1,332 words), checked by two native-speaker raters with an arbitrator. Hamza restoration cut WER by about 2 points, an error reduction of 25.5%.
Interesting ideas
- I1. When clean training data and messy input differ in one orthographic feature, train a dedicated restorer for that feature on the same corpus and run it first, instead of degrading the main model.
- I2. Turning a word-level restoration problem into per-character decisions avoids needing a dictionary entry for every word. Feeding whole neighboring words as symbolic features still gives the classifier lexical context.
- I3. The authors separate in-vitro testing (same treebank) from in-vivo testing (real web pages), and they simulate the mismatch by stripping hamza from test data while keeping it in training.
- I4. Memory-based learning keeps irregular examples instead of smoothing them away, and its feature weights show which context matters most. This fits a system that must justify its decisions.
- I5. The human raters found errors that could only be fixed with discourse knowledge: a noun phrase needed dual marking because the prisoner count is revealed only at the end of the story.
For Mova
How these ideas could serve Mova, our small open language model — its files, stages and tests:
- I1 (tokens): A small restorer for apostrophes, casing or hyphenation in noisy English could run before the tagger, so the tagger keeps seeing treebank-like input.
- I2 (tokens): This could help recover the spelling or morphology of unknown or misspelled words, with per-character choices that can be inspected.
- I3 (learn): Deliberately corrupted copies of held-out treebank data (no punctuation, lowercased) could serve as controls that show how much each normalization step really helps.
- I4 (tokens): A nearest-neighbor lemma or morphology fallback could cite the stored training instance behind each choice as its explanation.
- I5 (world): Entity counts tracked in the world model could be fed back to check or revise number agreement made earlier in the text.
Institutions
Fields, topics and concepts
📚 Shelves 4The field of science this work belongs to (OpenAlex fields).Computer Science · 16,667 worksArtificial Intelligence · 16,194 worksArts and Humanities · 16,039 worksLanguage and Linguistics · 15,891 works
🧭 Topics 1Research subjects and languages the work is about.Semitic languages · 2,908 works
Cite
Cite as Emad Mohamed and Sandra Kübler. 2009. Diacritization for Real-World Arabic Texts. Proceedings of the International Conference RANLP-2009.
@inproceedings{mohamed2009diacritization,
title = {{Diacritization for Real-World Arabic Texts}},
author = {Emad Mohamed and Sandra Kübler},
booktitle = {Proceedings of the International Conference RANLP-2009},
year = {2009},
url = {https://aclanthology.org/R09-1047/}
}References
- A. Bies and M. Maamouri. Penn Arabic Treebank guidelines. Technical report, LDC, University of Pennsylvania, 2003. find
- T. Buckwalter. Arabic morphological analyzer version 1.0. Linguistic Data Consortium, 2002. find
- T. Buckwalter. Arabic morphological analyzer version 2.0. Linguistic Data Consortium, 2004. find
- T. Buckwalter. Issues in Arabic morphological analysis. In A. Soudi, A. van den Bosch, and G. Neumann, editors, Arabic Computational Morphology: Knowledge-Based and Empirical Methods. Springer Verlag, 2007. ↗
- W. Daelemans and A. van den Bosch. Memory Based Language Processing. Cambridge University Press, 2005. ↗
- W. Daelemans, A. van den Bosch, and J. Zavrel. Forgetting exceptions is harmful in language learning. Machine Learning, 34:11–43, 1999. Special Issue on Natural Language Learning. ↗
- W. Daelemans, J. Zavrel, K. van der Sloot, and A. van den Bosch. TiMBL: Tilburg memory based learner – version 6.1 – reference guide. Technical Report ILK 07-07, Induction of Linguistic Knowledge, Computational Linguistics, Tilburg University, 2007. find
- F. Debili, H. Achour, and E. Souissi. De l’etiquetage grammatical a la voyellation automatique de l’arabe. Technical report, Correspondances de l’Institut de Recherche sur le Maghreb Contemporain, 2002. find
- M. Diab, M. Ghoneim, and N. Habash. Arabic diacritization in the context of statistical machine translation. In Proceedings of the Machine Translation Summit (MT-Summit), Copenhagen, Denmark, 2007.
- Y. Gal. An HMM approach to vowel restoration in Arabic and Hebrew. In Proceedings of the ACL-02 Workshop on Computational Approaches to Semitic Languages, Philadelphia, PA, 2002.
- N. Habash and O. Rambow. Arabic diacritization through full morphological tagging. In Proceedings of the North American Chapter of the Association for Computational Linguistics (NAACL), Rochester, NY, 2007.
- K. Kirchhoff, J. Bilmes, J. Henderson, R. Schwartz, M. Noa-many, P. Schone, G. Ji, S. Das, M. Egan, F. He, D. Vergyri, D. Liu, and N. Duta. Novel speech recognition models for Arabic - final report of the JHU summer workshop. Technical report, Johns Hopkins University, 2002. find
- S. Kübler and E. Mohamed. Memory-based vocalization of Arabic. In Proceedings of the LREC Workshop on HLT and NLP within the Arabic World, Marrakech, Morocco, 2008. find
- R. Nelken and S. Shieber. Arabic diacritization using weighed finite-state transducers. In Proceedings of the ACL Workshop on Computational Approaches to Semitic Language, Ann Arbor, MI, 2005. find
- K. Shaalan, H. Abo Bakr, and I. Ziedan. A hybrid approach for building Arabic diacritizer. In Proceedings of the EACL Workshop on Computational Approaches to Semitic Languages, Athens, Greece, 2009.
- I. Zitouni, J. Sorensen, and R. Sarikaya. Maximum entropy based restoration of Arabic diacritics. In Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, COLING-ACL-2006, Sydney, Australia, 2006.
Updated
This page in Markdown → https://md.research.elamur.ai/free/en/papers/mohamed-2009-diacritization-real-world-arabic-texts/