[Reconnaissance des déterminants français, Reconnaissance des déterminants français]
This article describes the implementation of a large-coverage description of French determiners and predeterminers, that includes simple words such as <i>le</i>, compounds such as <i>la plupart des</i>, and more complex sequences such as <i>toute une partie de ce groupe de</i>. 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 <i>Syntaxe du nom</i>, 1986.<br />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.<br />I show also that the difficult problem of describing recursive determiners and their constraints (e.g. in <i>un groupe de groupes d'amis</i>) 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.