Compiling Linguistic Constraints into Finite State Automata

This paper deals with linguistic constraints encoded in the form of (binary) tables, generally called lexicon-grammar tables. We describe a unified method to compile sets of tables of linguistic constraints into Finite State Automata. This method has been practically implemented in the linguistic platform Unitex.

[1]  Max Silberztein,et al.  INTEX: An FST Toolbox , 2000, Theor. Comput. Sci..

[2]  William A. Woods,et al.  Computational Linguistics Transition Network Grammars for Natural Language Analysis , 2022 .

[3]  Mehryar Mohri,et al.  Syntactic Analysis by Local Grammars Automata: an Efficient Algorithm , 1994, ArXiv.

[4]  Matthieu Constant,et al.  On the Analysis of Locative Phrases with Graphs and Lexicon-Grammar: The Classifier/Proper Noun Pairing , 2002, PorTAL.

[5]  Sébastien Paumier,et al.  De la reconnaissance des formes linguistiques à l'analyse syntaxique , 2003 .

[6]  M. Gross The Construction of Local Grammars , 1997 .

[7]  Emmanuel Roche,et al.  Finite-State Language Processing , 1997 .

[8]  Gregory Grefenstette,et al.  Regular expressions for language engineering , 1996, Natural Language Engineering.

[9]  Mehryar Mohri,et al.  Dynamic compilation of weighted context-free grammars , 1998, COLING.

[10]  B. Courtois,et al.  Un système de dictionnaires électroniques pour les mots simples du français , 1990 .

[11]  Denis Maurel Reconnaissance des séquences de mots par automate. Cas des adverbes de date du français , 1989 .

[12]  D. Maurel Building automaton on schemata and acceptability tables : Application to French date adverbials , 1997 .

[13]  Emmanuel Roche,et al.  Une représentation par automate fini des textes et des propriétés transformationnelles des verbes , 1993 .

[14]  Mathieu Constant Converting Linguistic Systems of Relational Matrices into Finite-State Transducers , 2003 .

[15]  Denis Maurel Building Automata on Schemata and Acceptability Tables: Application to French Data Adverbials , 1996, Workshop on Implementing Automata.

[16]  Maurice Gross,et al.  Lexicon-Grammar and the Syntactic Analysis of French , 1984, ACL.