---
title: "Arabic Word Generation and Modelling for Spell Checking (2012)"
description: "The paper addresses the lack of an adequate open-source spell-checking lexicon… 98.2% precision. 16 references, cited by 11 papers here."
authors: ["Khaled Shaalan", "Mohammed Attia", "Pavel Pecina", "Younes Samih", "Josef van Genabith"]
year: 2012
venue: "Proceedings of the Eighth International Conference on Language Resources and Evaluation (LREC'12)"
source: "https://aclanthology.org/L12-1344/"
licence: "CC BY-NC 4.0 (ELRA, LREC proceedings)"
licence_url: "https://creativecommons.org/licenses/by-nc/4.0/"
summary_licence: "Elamur Cosmic License"
canonical: "https://research.elamur.ai/free/en/papers/shaalan-2012-arabic-word-generation-modelling-spell/"
---
[Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/papers/shaalan-2012-arabic-word-generation-modelling-spell/)

[home](https://md.research.elamur.ai/free/en/) / [papers](https://md.research.elamur.ai/free/en/papers/) / [2012](https://md.research.elamur.ai/free/en/papers/2012/page/2/) / Arabic Word Generation and Modelling for Spell Checking

# Arabic Word Generation and Modelling for Spell Checking

**Authors:** [Khaled Shaalan](https://md.research.elamur.ai/free/en/authors/khaled-shaalan/), [Mohammed Attia](https://md.research.elamur.ai/free/en/authors/mohammed-attia/), [Pavel Pecina](https://md.research.elamur.ai/free/en/authors/pavel-pecina/), [Younes Samih](https://md.research.elamur.ai/free/en/authors/younes-samih/) and [Josef van Genabith](https://md.research.elamur.ai/free/en/authors/josef-van-genabith/) · **Year:** 2012 · **Venue:** [Proceedings of the Eighth International Conference on Language Resources and Evaluation (LREC'12)](https://md.research.elamur.ai/free/en/venues/lrec/) ([LREC 2012](https://md.research.elamur.ai/free/en/venues/lrec/2012/)) · **Publisher:** [European Language Resources Association (ELRA)](https://md.research.elamur.ai/free/en/publishers/european-language-resources-association-elra/) · **Licence:** [CC BY-NC 4.0 (ELRA, LREC proceedings)](https://creativecommons.org/licenses/by-nc/4.0/)

**Links:** [Publisher's page](https://aclanthology.org/L12-1344/) · [PDF](https://aclanthology.org/L12-1344.pdf) · [OpenAlex](https://openalex.org/W2250268234)

**Citations:** 36 citations (OpenAlex, 2026-10-14) · [11](https://md.research.elamur.ai/free/en/papers/shaalan-2012-arabic-word-generation-modelling-spell/cited-by/) in our library, of the 149,439 papers whose bibliographies we read

## Summary
The paper addresses the lack of an adequate open-source spell-checking lexicon for Arabic. Existing free resources such as Ayaspell (about 300K forms) and Arabic-Spell (about 900K forms) cover only a small part of the language's highly productive inflection and cliticization. The authors used the open-source finite-state morphological transducer AraComLex in generation mode to enumerate roughly 13 million surface forms. They filtered these, together with other word lists, through the Microsoft Spell Checker, which produced "AraComLex Extended", a list of about 9.3 million accepted words released under GPLv3.

The accepted and rejected forms then served as training data for two character-level tri-gram models, one for valid words and one for invalid ones. Comparing the two gives an error detector for words not in the list, reported at 98.2% precision at full recall.

For correction, the system combines finite-state edit-distance candidate search, Noisy Channel ranking, Arabic-specific letter-confusion costs and rules for splitting merged words. It clearly beats Hunspell but stays below MS Spell Checker. The work matters because it supplies a large free lexicon and a detector that generalizes beyond any fixed list.

## Key points
- AraComLex (30,587 lemmas) generated 12,951,042 forms. MS Spell Checker accepted 8,783,858 of them (68%). The merged, deduplicated list has 9,306,138 accepted words, and 5,841,061 forms were rejected.
- On a 400,000-word news test set kept separate from Gigaword, AraComLex Extended scored 0.9840 coverage, 0.9998 accuracy and 0.9999 f-measure. Ayaspell's 292,464-word list scored 0.5529 coverage.
- Detection uses two character tri-gram models built with SRILM. The abstract reports 98.2% precision at 100% recall, while the introduction gives 97%.
- First-choice correction accuracy on 1,799 misspelled words:
  - MS Spell Checker: 80.54%
  - Hunspell with Ayaspell: 45.64%
  - edit distance plus Noisy Channel: 68.2%
  - with added heuristics: 71.3%
  - with post-processing of unknown words: 75%
- Of 227 words that received no candidates, 63% were two or more words run together. Regex rules targeting 7 frequent particles and words fixed 102 of the 105 affected cases.

## Interesting ideas
- Instead of collecting attested words from a corpus, run a bidirectional morphological analyser backwards to enumerate every form it licenses, then filter the output with an external judge; this finds forms no corpus contains.
- Train one character n-gram model on accepted forms and another on rejected forms, then classify a new word by which model scores it higher; this captures legal letter clusters without needing an explicit rule for each constraint.
- Lower the edit cost for substitutions within known confusion groups of letters, so that the ranking reflects real error patterns rather than treating every letter change as equal.
- Scale the allowed number of edits with word length, setting the threshold from the corpus distribution of word lengths, so short words are not over-corrected and long words are not under-corrected.
- Examine the cases where no candidates are produced; many turned out to be merged words that a few split rules repair, which shows that diagnosing failure classes can pay off more than tuning the ranker.

## For Mova

How these ideas could serve Mova, our small open language model — its files, stages and tests:

- **I1** (tokens): Generating all inflections from the crate en lemma lexicon would give a closed list of valid forms to check the tagger and lemmatizer against.
- **I2** (tokens): A valid-versus-invalid character model could flag unknown tokens as likely typos or as plausible new words before morphology tries to analyse them.
- **I3** (learn): Self-induced repair rules could weight candidate fixes by observed confusion classes, such as frequent tag or attachment swaps, rather than by flat counts.
- **I4** (tokens): Tokenizer normalisation could use length-dependent edit budgets when mapping noisy tokens to lexicon entries.
- **I5** (learn): Evaluation could routinely group zero-output parser and reader failures into classes, so that cheap targeted rules are written before any retraining.

*Our summary of the paper, in our own words — not its text. The work belongs to its authors; read it at the links above.*

## Institutions

- [Charles University](https://md.research.elamur.ai/free/en/universities/charles-university/) — University, Prague, Czechia · 133 works · 20,686 citations
- [Dublin City University](https://md.research.elamur.ai/free/en/universities/dublin-city-university/) — University, Dublin, Ireland · 70 works · 9,447 citations
- [Heinrich Heine University Düsseldorf](https://md.research.elamur.ai/free/en/universities/heinrich-heine-university-dusseldorf/) — University, Düsseldorf, Germany · 33 works · 1,487 citations
- [British University in Dubai](https://md.research.elamur.ai/free/en/universities/british-university-in-dubai/) — University, Dubai, United Arab Emirates · 10 works · 587 citations

📚 Shelves (4): [🖥️ Computer Science](https://md.research.elamur.ai/free/en/shelves/computer-science/) · 16,667 works · [🤖 Artificial Intelligence](https://md.research.elamur.ai/free/en/shelves/computer-science/artificial-intelligence/) · 16,194 works · [🎭 Arts and Humanities](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/) · 16,039 works · [🗣️ Language and Linguistics](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/language-and-linguistics/) · 15,891 works

🧭 Topics (2): [Semitic languages](https://md.research.elamur.ai/free/en/topics/semitic-languages/) · 2,908 works · [🖍️ Grammatical error correction & learner language](https://md.research.elamur.ai/free/en/topics/grammatical-error-correction/) · 156 works

## Cite

Cite as: Khaled Shaalan, Mohammed Attia, Pavel Pecina, Younes Samih and Josef van Genabith. 2012. Arabic Word Generation and Modelling for Spell Checking. Proceedings of the Eighth International Conference on Language Resources and Evaluation (LREC'12).

The paper itself, not this page. BibTeX from the library's record of the work.

```bibtex
@inproceedings{shaalan2012arabic,
  title = {{Arabic Word Generation and Modelling for Spell Checking}},
  author = {Khaled Shaalan, Mohammed Attia, Pavel Pecina, Younes Samih and Josef {van Genabith}},
  booktitle = {Proceedings of the Eighth International Conference on Language Resources and Evaluation (LREC'12)},
  year = {2012},
  doi = {10.63317/4c4ivvhra629},
  url = {https://doi.org/10.63317/4c4ivvhra629}
}
```

- [← previous Elissa: A Dialectal to Standard Arabic Machine Translation System](https://md.research.elamur.ai/free/en/papers/salloum-2012-elissa-dialectal-standard-arabic-machine/)
- [next → Implicit Discourse Relation Recognition by Selecting Typical Training Examples](https://md.research.elamur.ai/free/en/papers/wang-2012-implicit-discourse-relation-recognition-selecting/)
- [↑ back to papers of 2012](https://md.research.elamur.ai/free/en/papers/2012/page/2/)

## References

16 references, 4 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet.

1. Attia, Mohammed, Pavel Pecina, Lamia Tounsi, Antonio Toral, Josef van Genabith. (2011). [An Open-Source Finite State Morphological Transducer for Modern Standard Arabic](https://md.research.elamur.ai/free/en/papers/attia-2011-open-source-finite-state-morphological/). International Workshop on Finite State Methods and Natural Language Processing (FSMNLP). Blois, France.
2. Beesley, K. R., and Karttunen, L. (2003). Finite State Morphology: CSLI studies in computational linguistics. Stanford, Calif.: CSLI. [find](https://scholar.google.com/scholar?q=Beesley%2C+K%2E+R%2E%2C+and+Karttunen%2C+L%2E+%282003%29%2E+Finite+State+Morphology%3A+CSLI+studies+in+computational+linguistics%2E+Stanford%2C+Calif%2E%3A+CSLI%2E)
3. Ben Othmane Zribi C. and Ben Ahmed M., Efficient Automatic Correction of Misspelled Arabic Words Based on Contextual Information, Lecture Notes in Computer Science, (Springer, 2003), Vol. 2773, pp.770–777. [find](https://scholar.google.com/scholar?q=Ben+Othmane+Zribi+C%2E+and+Ben+Ahmed+M%2E%2C+Efficient+Automatic+Correction+of+Misspelled+Arabic+Words+Based+on+Contextual+Information%2C+Lecture+Notes+in+Computer+Science%2C+%28Springer%2C+2003%29%2C+Vol%2E+2773%2C+pp%2E770)
4. Brill, Eric and Robert C. Moore. 2000. [An improved error model for noisy channel spelling correction](https://md.research.elamur.ai/free/en/papers/brill-2000-improved-error-model-noisy-channel/). ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics.
5. Choudhury, Monojit, Rahul Saraf, Vijit Jain, Animesh Mukherjee, Sudeshna Sarkar and Anupam Basu. 2007. Investigation and modeling of the structure of texting language. International Journal on Document Analysis and Recognition. Volume 10, Numbers 3-4, 157-174, DOI: 10.1007/s10032-007-0054-0 [↗](https://doi.org/10.1007/s10032-007-0054-0)
6. Davis, Clodoveu A., Emerson de Salles. (2007). Approximate String Matching for Geographic Names and Personal Names. In Proceedings of GeoInfo'2007. pp.49-60. [find](https://scholar.google.com/scholar?q=Davis%2C+Clodoveu+A%2E%2C+Emerson+de+Salles%2E+%282007%29%2E+Approximate+String+Matching+for+Geographic+Names+and+Personal+Names%2E+In+Proceedings+of+GeoInfo%272007%2E+pp%2E49%2D60%2E)
7. Hajič, J., Smrž, O., Buckwalter, T., and Jin, H. (2005). Feature-Based Tagger of Approximations of Functional Arabic Morphology. In: The 4th Workshop on Treebanks and Linguistic Theories (TLT 2005), Barcelona, Spain. [find](https://scholar.google.com/scholar?q=Haji%C4%8D%2C+J%2E%2C+Smr%C5%BE%2C+O%2E%2C+Buckwalter%2C+T%2E%2C+and+Jin%2C+H%2E+%282005%29%2E+Feature%2DBased+Tagger+of+Approximations+of+Functional+Arabic+Morphology%2E+In%3A+The+4th+Workshop+on+Treebanks+and+Linguistic+Theories+%28TLT+2005%29%2C+B)
8. Hassan, Ahmed, Sara Noeman and Hany Hassan. (2008). Language Independent Text Correction using Finite State Automata. IJCNLP. [find](https://scholar.google.com/scholar?q=Hassan%2C+Ahmed%2C+Sara+Noeman+and+Hany+Hassan%2E+%282008%29%2E+Language+Independent+Text+Correction+using+Finite+State+Automata%2E+IJCNLP%2E)
9. Hyderabad, India Hulden, Mans. (2009). Fast Approximate String Matching with Finite Automata. Proceedings of SEPLN. [find](https://scholar.google.com/scholar?q=Hyderabad%2C+India+Hulden%2C+Mans%2E+%282009%29%2E+Fast+Approximate+String+Matching+with+Finite+Automata%2E+Proceedings+of+SEPLN%2E)
10. Hulden, Mans. (2009). Foma: a Finite-state compiler and library. EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics. Association for Computational Linguistics Stroudsburg, PA, USA Kernigan, M., Church, K., Gale W. (1990). [A Spelling Correction Program Based on a Noisy Channel Model](https://md.research.elamur.ai/free/en/papers/kernighan-1990-spelling-correction-program-based-noisy/). AT & T Laboratories, 600 Mountain Ave., Murray Hill, NJ.
11. Kiraz, G. A. (2001). Computational Nonlinear Morphology: With Emphasis on Semitic Languages. Cambridge University Press. [find](https://scholar.google.com/scholar?q=Kiraz%2C+G%2E+A%2E+%282001%29%2E+Computational+Nonlinear+Morphology%3A+With+Emphasis+on+Semitic+Languages%2E+Cambridge+University+Press%2E)
12. Levenshtein, V. I. (1966). Binary codes capable of correcting deletions, insertions, and reversals. In: Soviet Physics Doklady, pp. 707-710. [find](https://scholar.google.com/scholar?q=Levenshtein%2C+V%2E+I%2E+%281966%29%2E+Binary+codes+capable+of+correcting+deletions%2C+insertions%2C+and+reversals%2E+In%3A+Soviet+Physics+Doklady%2C+pp%2E+707%2D710%2E)
13. Magdy, Walid and Kareem Darwish. (2006). [Arabic OCR error correction using character segment correction, language modeling, and shallow morphology](https://md.research.elamur.ai/free/en/papers/magdy-2006-arabic-ocr-error-correction-character/). EMNLP '06 Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing.
14. Mitton, Roger (1996). English spelling and the computer. Harlow, Essex: Longman Group Oflazer, K. (1996) Error-tolerant finite-state recognition with applications to morphological analysis and spelling correction. Computational Linguistics 22(1): 73-90 [find](https://scholar.google.com/scholar?q=Mitton%2C+Roger+%281996%29%2E+English+spelling+and+the+computer%2E+Harlow%2C+Essex%3A+Longman+Group+Oflazer%2C+K%2E+%281996%29+Error%2Dtolerant+finite%2Dstate+recognition+with+applications+to+morphological+analysis+and+spellin)
15. Watson, J. (2002). The Phonology and Morphology of Arabic, New York: Oxford University Press. [find](https://scholar.google.com/scholar?q=Watson%2C+J%2E+%282002%29%2E+The+Phonology+and+Morphology+of+Arabic%2C+New+York%3A+Oxford+University+Press%2E)
16. Wintner, Shuly. (2008). Strengths and weaknesses of finite-state technology: a case study in morphological grammar development Natural Language Engineering 14(4):457-469, October 2008. [find](https://scholar.google.com/scholar?q=Wintner%2C+Shuly%2E+%282008%29%2E+Strengths+and+weaknesses+of+finite%2Dstate+technology%3A+a+case+study+in+morphological+grammar+development+Natural+Language+Engineering+14%284%29%3A457%2D469%2C+October+2008%2E)

*Updated 30 October 2026*