Edited by Christian Leclère, Éric Laporte, Mireille Piot and Max Silberztein
[Lingvisticæ Investigationes Supplementa 24] 2004
► pp. 589–600
This article describes the implementation of a large-coverage description of French determiners and predeterminers, that includes simple words such as le, compounds such as la plupart des, and more complex sequences such as toute une partie de ce groupe de. The grammar is available in the form of a library of over one hundred INTEX graphs. Its organization follows as closely as possible the classification of the determiners described by Maurice Gross in Syntaxe du nom, 1986. Using INTEX graphs to represent syntactic constraints on the grammatical words that constitute determiners presents several advantages over using two-dimension lexicon-grammar tables, especially in terms of legibility. I show also that the difficult problem of describing recursive determiners and their constraints (e.g. in un groupe de groupes d'amis) is naturally described by recursive graphs. This library can be compiled into a (non-recursive) minimal deterministic finite-state automaton that contains over 1,000 states and 25,000 transitions.
Article language: French