Elamur Research⌕
☰
home / papers / 2011 / Construction d'une grammaire d'arbres adjoints pour la langue arabe (Construction of a tree adjoining grammar for the Arabic language)

Construction d'une grammaire d'arbres adjoints pour la langue arabe (Construction of a tree adjoining grammar for the Arabic language)

Paper · 2011 · Ben Fraj, Fériel

Summary

The paper tackles how to write a formal grammar for Arabic, a language where syntax depends heavily on morphology and semantics. For example, a plural noun denoting non-humans normally takes a feminine singular adjective, while a human plural agrees fully. Instead of extracting rules from a treebank, the author builds ArabTAG, a hand-designed Tree Adjoining Grammar. Its elementary trees carry rich unification feature structures covering morphological, syntactic, semantic and compositional properties.

To support this work, she developed a semi-automatic, modular authoring application. Through a friendly interface, a linguist creates elementary trees and attaches features to nodes. The tool checks the tree hierarchy and the feature structures so that rules stay correct and uniform, then serializes the grammar to XML.

Using the tool, version 1.0 of ArabTAG was produced: 380 elementary trees grouped into four families. The grammar covers ellipsis, anaphora, subordinate clauses, word-order variation and clitic agglutination. This matters because corpus-extracted grammars only cover constructions that the corpus happens to contain.

Key points

  • ArabTAG v1.0 contains 380 elementary trees in four families, built on the reference grammars of Dahdah (1992) and Kouloughli (1992).
  • Only "generic" trees are encoded, holding just the obligatory elements (e.g., verb, subject and objects, or theme and predicate). Optional complements such as time, place or manner adverbials attach through TAG operations, which keeps word-order permutations from multiplying the number of trees.
  • Node features include Gen, Nombr, Cas/TestCas, Def/TypeDef/TestDef, Pronom, Trans, Voix, Temps, Proc and Enc, plus omission flags (OmissionSujet, OmissionCOD, etc.), Propre, Rôle, Animé and Humain.
  • The prior TAG of Habash and Rambow (2004) was extracted from PATB part 1 v2.0 (160,000 news words). It captured VSO and SVO orders but no VOS, because that order was missing from the corpus.
  • Planned extensions include a prediction module based on the existing grammar, full lexicalization, and converters to other formalisms.

Interesting ideas

  • I1. Treat animacy and humanness as first-class grammatical features, because agreement can hinge on them rather than on surface number alone.
  • I2. A grammar derived from a corpus inherits that corpus's blind spots, as the missing VOS order shows; hand-written structures can deliberately fill such gaps.
  • I3. Encode only the minimal core of each construction and attach optional modifiers separately, which avoids a combinatorial explosion of templates when word order is flexible.
  • I4. Explicit features state whether a slot such as subject or object may or must be omitted, so ellipsis is predicted rather than treated as an error.
  • I5. An authoring tool that validates hierarchy and feature consistency as each rule is entered, then exports to a neutral XML format, keeps a hand-built resource uniform.

For Mova

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

  • I1 (frames): Animé/Humain-style flags on mentions could constrain pronoun resolution (he/she vs. it, who vs. which) and filter semantic-role candidates in a way that remains explainable.
  • I2 (learn): audit silver treebanks for constructions that never or rarely occur, then add controlled synthetic or hand-crafted examples for them as targeted coverage tests.
  • I3 (tree): repair rules and UD dialect conversions could be keyed on core-argument skeletons only, with obl/advmod handled by a generic attachment step, keeping the rule set small.
  • I4 (frames): frame slots could record whether an argument is expected but unrealized (imperatives, agentless passives, ellipsis), letting the world builder fill it from context or flag it.
  • I5 (world): a validator-backed editor for verb classes and ontology entries would catch inconsistent feature values early and keep the compiled knowledge independent of any one consumer.

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

 Fields, topics and concepts

📚 Shelves 2The field of science this work belongs to (OpenAlex fields).Computer Science · 18,614 worksArtificial Intelligence · 17,965 works

🧭 Topics 2Research subjects and languages the work is about.Semitic languages · 3,066 worksSyntax & grammar formalisms · 221 works

Cite

Cite as Ben Fraj, Fériel. 2011. Construction d'une grammaire d'arbres adjoints pour la langue arabe (Construction of a tree adjoining grammar for the Arabic language). Actes de la 18e conférence sur le Traitement Automatique des Langues Naturelles. Articles courts.

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

@inproceedings{feriel2011construction,
  title = {{Construction d'une grammaire d'arbres adjoints pour la langue arabe (Construction of a tree adjoining grammar for the Arabic language)}},
  author = {Ben Fraj, Fériel},
  booktitle = {Actes de la 18e conférence sur le Traitement Automatique des Langues Naturelles. Articles courts},
  year = {2011},
  url = {https://aclanthology.org/2011.jeptalnrecital-court.19/}
}

References

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

  1. A BEILLE A. (1993). Les nouvelles syntaxes, Armand Colin. find
  2. A TTIA M OHAMMED A. (2008). Handling Arabic Morphological and Syntactic Ambiguity within the LFG Framework with a View to Machine Translation, Thèse de doctorat, Faculty of humanities, University of Manchester. find
  3. B EN F RAJ F. (2010). Un analyseur syntaxique pour les textes en langue arabe à base d’un apprentissage à partir de patrons d’arbres syntaxiques, Thèse de doctorat, Ecole Nationale des Sciences de l’Informatique, Université de La Manouba. find
  4. B EN F RAJ F., B EN O THMANE Z RIBI C., B EN A HMED M. (2008). Ensemble Classification for Parsing Arabic Texts: A Theoretical Approach, In Proceedings of the AIPR 2008 multi-conference, Orlando, Florida, USA, 51-57. find
  5. B LACHÈRE R., and G AUDEFROY - DEMOMBYNES M. (1975). Grammaire de la langue arabe, Maisonneuve et Larose. find
  6. C HOMSKY N. (1965) Aspects of the theory of syntax, Cambridge, Massachusetts: MIT Press. find
  7. D AHDAH A. (1992). تﺎﺣﻮﻟو لواﺪﺟ ﻲﻓ ﺔﯿﺑﺮﻌﻟا ﺔﻐﻠﻟا ﺪﻋاﻮﻗ ﻢﺠﻌﻣ, Librairie de Nachirun Lebanon, 5ème edition, 1992. find
  8. H ABASH N., R AMBOW O. (2004). Extracting Tree Adjoining Grammar from the Penn Arabic Treebank, JEP-TALN 2004, Session Traitement Automatique de l’Arabe, Fès. find
  9. H ADDAR K., B OUKEDI S., Z ALILA I. (2010). Construction of an HPSG grammar for the Arabic language and its specification in TDL, International Journal on Information and Communication Technologies, vol. 3, n° 3. find
  10. J OSHI A. K., L EVY L. S., T AKAHASHI M. (1975). Tree adjunct grammars, Journal of the Computer and System Sciences, vol. 10, n° 1, 136-163. find
  11. K AHANE S. (2002). Grammaire d'Unification Sens-Texte – Vers un modèle mathématique articulé de la langue, Hdr de l'Université Paris 7, 82. find
  12. K APLAN R. M., B RESNAN J. (1982). Lexical functional grammar: A formal system for grammatical representation, In J. BRESNAN, Ed., The Mental Representation of Grammatical Relations. Cambridge, Mass.: MIT Press, 173-281. find
  13. K OULOUGHLI J. (1992). La grammaire Arabe pour tous, Edition Presses Pocket. find
  14. L ECOMTE A., Méthodes pour le Traitement Automatique des Langues, cours Ingénierie de la Communication Personne-Système, Université Pierre Mendès-France, France, 2004. find
  15. M AAMOURI M., B IES A., B UCKWALTER T., M EKKI W. (2004). The Penn Arabic Treebank: Building a Large-Scale Annotated Arabic Corpus, In NEMLAR International Conference on Arabic Language Resources and Tools, 102-109. find
  16. P EREIRA F. C. N. and W ARREN D. H. D. (1980). Definite clause grammars for language analysis : a survey of the formalism and a comparison with augmented transition networks. Artificial Intelligence 13, pp. 231 – 278. find
  17. P OLLARD C., and S AG I. (1994). Head-driven Phrase Structure Grammar, CLSI series, University of Chicago. find

Updated

↑ back to top

This page in Markdown → https://md.research.elamur.ai/free/en/papers/fraj-2011-construction-d-une-grammaire-d/