Une Représentation par Automate Fini des Textes et des Propriétés Transformationnelles des Verbes

We propose here to use finite state automata to represent morphologically tagged sentences. This formalism is especially relevant for the tagging of the ambiguities: (i) morphological features ambiguities, (ii) part of speech ambiguities and (iii) compound vs. sequence of simple words ambiguities. Formal operations on automata can then be applied to recognize patterns that can be words or sequences of words specified with or without morphological features specifications (a masculine noun for instance). We then consider the part of the lexicon-grammar that specifies the argument structure of the verbs and show that it can be semi-automati-cally translated into the same formalism. We take advandtage of this to start a syntactic analysis.