A Layered Language Model based Hybrid Approach to Automatic Full Diacritization of Arabic
Paper · 2017 · Mohamed Al-Badrashiny, Abdelati Hawwari and Mona Diab
Summary
Arabic is normally written without most short-vowel and related marks, which leaves many words ambiguous for both readers and downstream tools such as POS tagging, text-to-speech and MT. The authors restore full diacritization (lexical plus word-final syntactic marks) for MSA. Their method chains three diacritized language models: one over surface words, one over prefix/stem/suffix morphemes, and one over characters with their diacritics. A lattice search, Viterbi or A*, picks the best candidate in context. The word model runs first. Its output is then checked against the SAMA morphological analyzer, and the morpheme model resolves the remaining choices. The character model handles only words that are still unknown. They train and test on the LDC Arabic Treebank Part 3 split used by earlier work, but they also carve out a separate development set. On the held-out TEST set the system reaches 10.87% WER for full diacritization and 3.0% WER when case endings are ignored. It leads on the lexical level, which shows that a carefully layered n-gram approach can match or beat neural systems of its time.
Key points
- The data is LDC2004T11 (Arabic Treebank Part 3 v1.0, Annahar News Text). It has 600 documents and 340,281 words. TEST is the chronologically last 15%, about 52K words in 90 documents. The original training part was split into TRAIN (~259K) and DEV (~29K).
- n-gram orders are kept aligned across layers. One word corresponds to 3 morpheme grams and 4 character grams, so a word bigram maps to a 6-gram MLM and an 8-gram CLM.
- The best DEV configuration used Viterbi with 2-gram-equivalent models. It reached 6.11% WER (FULL) and 2.61% WER (MORPH).
- On TEST the system scores 10.87% WER for FULL and 3.0% WER for lexical-only diacritization. It beats all baselines at the MORPH level. At the FULL level, Abandah et al. (2015) do better (9.07% WER) because their system handles case endings better.
- The system is compared against five baselines: Belinkov and Glass (2015), Abandah et al. (2015), Rashwan et al. (2011), Habash and Rambow (2007) and Zitouni et al. (2006).
Interesting ideas
- I1. The system backs off by granularity: whole-word evidence is trusted first, morpheme evidence comes next, and a character model is used only for words still unresolved, so each decision traces to one layer.
- I2. A rule-based morphological analyzer serves as a filter on statistical output: only analyses consistent with the LM's choice are kept, while unknown words keep every candidate.
- I3. Unknown words do not split the sentence into separate pieces; they stay in the lattice with an unknown-word probability, so the neighbouring words still give context across them.
- I4. The authors noticed that earlier work tuned on its own test set, so they cut a dev set out of training and touched TEST only once, with the final configuration.
- I5. Scores are reported twice, with and without word-final syntactic marks, which separates lexical errors from grammar-driven ones.
For Mova
How these ideas could serve Mova, our small open language model — its files, stages and tests:
- I1 (tokens): lemma and morphology lookup for unseen English words could follow the same order: lexicon, then affix analysis, then a character model. Each output would record which layer produced it.
- I2 (tokens): the morphology analyzer could prune its readings against the tagger's choice. Untagged or unknown tokens would keep their full candidate set for later stages to decide.
- I3 (tree): the parser and tagger could treat OOV tokens as placeholders inside one search instead of breaking the input. This keeps attachment decisions around rare words informed by the whole sentence.
- I4 (learn): every repair rule or teacher-tier threshold should be tuned on a dev slice that is separate from the reported evaluation set, so scores are not inflated.
- I5 (learn): parser and reader evaluations could likewise be split by error source, such as lemma/POS errors versus attachment or role errors. This shows which stage actually needs work.
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 3Research subjects and languages the work is about.Language models & pretraining · 3,320 worksSemitic languages · 2,908 worksMorphology · 405 works
Cite
Cite as Mohamed Al-Badrashiny, Abdelati Hawwari and Mona Diab. 2017. A Layered Language Model based Hybrid Approach to Automatic Full Diacritization of Arabic. Proceedings of the Third Arabic Natural Language Processing Workshop.
@inproceedings{albadrashiny2017layered,
title = {{A Layered Language Model based Hybrid Approach to Automatic Full Diacritization of Arabic}},
author = {Mohamed Al-Badrashiny, Abdelati Hawwari and Mona Diab},
booktitle = {Proceedings of the Third Arabic Natural Language Processing Workshop},
year = {2017},
doi = {10.18653/v1/w17-1321},
url = {https://doi.org/10.18653/v1/w17-1321}
}References
- Gheith A. Abandah, Alex Graves, Balkees Al-Shagoor, Alaa Arabiyat, Fuad Jamour, and Majid Al-Taee. 2015. Automatic diacritization of arabic text using recurrent neural networks. International Journal on Document Analysis and Recognition (IJDAR), 18(2):183–197. ↗
- M. A.A. Rashwan, M. A.S.A.A. Al-Badrashiny, M. Attia, S. M. Abdou, and A. Rafea. 2011. A stochastic arabic diacritizer based on a hybrid of factorized and unfactorized textual features. Trans. Audio, Speech and Lang. Proc., 19(1):166–175, January. ↗
- Sankaranarayanan Ananthakrishnan, Srinivas Bangalore, and Shrikanth S. Narayanan. 2005. Automatic diacritization of arabic transcripts for automatic speech recognition. In Proceedings of the International Conference on Natural Language Processing (ICON), Kanpur, India, December. find
- Khaled Shaalan, Hitham M. Abo Bakr, and Ibrahim Ziedan. 2009. A hybrid approach for building arabic diacritizer. In Proceedings of the EACL 2009 Workshop on Computational Approaches to Semitic Yonatan Belinkov and James Glass. 2015. Arabic diacritization with recurrent neural networks. In Pro-Languages, Semitic ’09, pages 27–35, Stroudsburg, PA, USA. Association for Computational Linguistics.
- Wajdi Zaghouani, Houda Bouamor, Abdelati Hawwari, Mona Diab, Ossama Obeid, Mahmoud Ghoneim, Sawsan Alqahtani, and Kemal Oflazer. 2016. Guidelines and framework for a large scale arabic diacritized corpus. In Nicoletta Calzolari (Conference Chair), Khalid Choukri, Thierry Declerck, Sara Goggi, Marko Grobelnik, Bente Maegaard, Joseph Mariani, Helene Mazo, Asuncion Moreno, Jan Odijk, and Stelios Piperidis, editors, Proceedings of the Tenth International Conference on Language Resources and Evaluation (LREC 2016), Paris, France, may. European Language Resources Association (ELRA).
- Imed Zitouni, Jeffrey S. Sorensen, and Ruhi Sarikaya. 2006. Maximum entropy based restoration of arabic diacritics. In Proceedings of the 21st International Conference on Computational Linguistics and the 44th Annual Meeting of the Association for Computational Linguistics, ACL-44, pages 577– 584, Stroudsburg, PA, USA. Association for Computational Linguistics.
Updated
This page in Markdown → https://md.research.elamur.ai/free/en/papers/badrashiny-2017-layered-language-model-based-hybrid/