Elamur Research⌕
☰
home / papers / 2007 / Determining Case in Arabic: Learning Complex Linguistic Behavior Requires Complex Linguistic Features

Determining Case in Arabic: Learning Complex Linguistic Behavior Requires Complex Linguistic Features

Paper · 2007 · Nizar Habash, Ryan Gabbard, Owen Rambow et al.

Summary

The paper addresses automatic case assignment (nominative, accusative, genitive) for nouns and adjectives in Modern Standard Arabic. Case is usually written only with optional short-vowel diacritics, and it is a leading cause of errors in full diacritization. Even native speakers lack intuitions about it, because the spoken dialects have lost case. The authors work on gold trees from the Arabic Treebank (ATB) and compare a machine-learned classifier with hand-written rules.

The key move is a change of representation. Features read directly from ATB phrase structure, which encodes predicate-argument structure, are not enough. So the authors rebuild the trees around case assigners: idafa, tamyiz with numbers, inna-type conjunctions, copulas, and agreement. On this representation the learned system reaches about 4.2% error.

A manual error analysis then shows that most remaining "errors" are actually treebank annotation mistakes. Once these are discounted, the error rate falls to roughly 0.8%, and the rules become more accurate than the learner. This makes the tool useful both for diacritization and for treebank quality control.

Key points

  • Data: ATB part 3 (LDC), with the training/devtest split of Zitouni et al. (2006) and the devtest halved into dev and test sets. Training has about 367K words; dev and test have about 33K words each.
  • Of 133,250 case-marked training nominals, 66.4% are GEN, 18.5% ACC and 15.1% NOM. Nominals marked NO-CASE (invariables) are excluded from evaluation.
  • Motivation from earlier work: diacritization word error rate drops by 9.4% absolute (to 5.5%) when word-final diacritics need not be predicted.
  • The case-oriented representation helps the statistical system much more than the rules. The gap between the two grows to a 25% error reduction in favour of the learner.
  • Error analysis on 105 dev sentences: the rules reach 94.1% accuracy and the learner 96.2%. Gold POS or tree errors account for 69% of the learner's errors and 86% of the rules' errors. The learner's genuine system-error share (31%) is about twice that of the rules (14%), meaning it absorbs treebank noise.

Interesting ideas

  • I1. Re-encode the tree around the phenomenon you are predicting (here, who assigns case to whom) instead of reusing the annotation's native predicate-argument view, because the right features may simply not be visible in the original structure.
  • I2. Separate case-by-assignment from case-by-agreement: modifiers and conjuncts copy the value of their governor rather than receiving it from an assigner, so the two decisions should be modelled differently.
  • I3. Classify every system error in the analysis as either a genuine system mistake or a gold POS or tree error, because a large share of apparent errors may really be bad annotation.
  • I4. A high-precision rule system makes a good annotation auditor: when it disagrees with the gold data, the gold is often wrong, whereas a learner tends to reproduce the annotators' mistakes.
  • I5. Hand-written rules count as empirical NLP when they are developed and tested on held-out splits like any model, and on some phenomena they match or beat learning.

For Mova

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

  • I1 (tree): before training morphology- or agreement-sensitive classifiers on UD trees, derive a task-specific view (e.g. agreement controller → target edges) rather than reading features straight off deprels.
  • I2 (tokens): feature prediction (number, case on pronouns, person) can propagate through amod/conj chains from the head instead of predicting each token independently, which also yields a clear explanation trail.
  • I3 (learn): when evaluating against silver or gold treebanks, sample disagreements and label them system vs. gold error, so that noisy references do not hide the true accuracy.
  • I4 (learn): use explainable rule checks (e.g. agreement or case constraints on English pronouns) as an extra witness that flags suspicious silver trees for repair rather than training on them.
  • I5 (frames): rule-based frame and role assignment can be kept and benchmarked on dev/test splits alongside learned components, choosing per phenomenon based on measured accuracy.

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

 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 Nizar Habash, Ryan Gabbard, Owen Rambow, Seth Kulick and Mitch Marcus. 2007. Determining Case in Arabic: Learning Complex Linguistic Behavior Requires Complex Linguistic Features. Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL).

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

@inproceedings{habash2007determining,
  title = {{Determining Case in Arabic: Learning Complex Linguistic Behavior Requires Complex Linguistic Features}},
  author = {Nizar Habash, Ryan Gabbard, Owen Rambow, Seth Kulick and Mitch Marcus},
  booktitle = {Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL)},
  year = {2007},
  url = {https://aclanthology.org/D07-1116/}
}

References

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

  1. Ron Buckley. 2004. Modern Literary Arabic: A Reference Grammar. Librairie du Liban. find
  2. Tim Buckwalter. 2002. Buckwalter Arabic morphological analyzer version 1.0. ↗
  3. Michael Collins. 1997. Three Generative, Lexicalised Models for Statistical Parsing. In Proceedings of the 35th Annual Meeting of the ACL (jointly with the 8th Conference of the EACL), pages 16–23, Madrid, Spain. ↗
  4. Nizar Habash and Owen Rambow. 2007. Arabic Diacritization through Full Morphological Tagging. In Proceedings of the 8th Meeting of the North American Chapter of the Association for Computational Linguistics/Human Language Technologies Conference (HLT-NAACL07).
  5. Nizar Habash, Abdelhadi Soudi, and Tim Buckwalter. 2007. On Arabic Transliteration. In A. van den Bosch and A. Soudi, editors, Arabic Computational Morphology: Knowledge-based and Empirical Methods. Springer. ↗
  6. Clive Holes. 2004. Modern Arabic: Structures, Functions, and Varieties. Georgetown University Press. Revised Edition. find
  7. Mohamed Maamouri, Ann Bies, Tim Buckwalter, and Wigdan Mekki. 2004. The Penn Arabic Treebank : Building a Large-Scale Annotated Arabic Corpus. In NEMLAR Conference on Arabic Language Resources and Tools, pages 102–109, Cairo, Egypt. find
  8. Andrew Kachites McCallum. 2002. Mallet: A machine learning for language toolkit. http://mallet.cs.umass.edu. ↗
  9. Rani Nelken and Stuart Shieber. 2005. Arabic Diacritization Using Weighted Finite-State Transducers. In Proceedings of the Workshop on Computational Approaches to Semitic Languages at 43rd Meeting of the Association for Computational Linguistics (ACL’05), pages 79–86, Ann Arbor, Michigan.
  10. Otakar Smrž and Jan Hajič. 2006. The Other Arabic Treebank: Prague Dependencies and Functions. In Ali Farghaly, editor, Arabic Computational Linguistics: Current Implementations. CSLI Publications. find
  11. Dimitra Vergyri and Katrin Kirchhoff. 2004. Automatic Diacritization of Arabic for Acoustic Modeling in Speech Recognition. In Ali Farghaly and Karine Megerdoomian, editors, COLING 2004 Workshop on Computational Approaches to Arabic Script-based Languages, pages 66–73, Geneva, Switzerland. ↗
  12. 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 44th Annual Meeting of the Association for Computational Linguistics, pages 577–584, Sydney, Australia.

Updated

↑ back to top

This page in Markdown → https://md.research.elamur.ai/free/en/papers/habash-2007-determining-case-arabic-learning-complex/