Compiling Linguistic Constraints into Finite State Automata

  • Matthieu Constant
  • Denis Maurel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4094)


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.


Noun Phrase Lexical Entry Word Class Finite State Automaton Linguistic Phenomenon 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Constant, M.: On the Analysis of Locative Phrases with Graphs and Lexicon-Grammar: The Classifier/Proper Noun Pairing. In: Ranchhod, E., Mamede, N.J. (eds.) PorTAL 2002. LNCS (LNAI), vol. 2389, pp. 33–42. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  2. 2.
    Constant, M.: Converting Linguistic Systems of Relational Matrices into Finite-State Transducers. In: Proceedings of the EACL Workshop on Finite-State Methods in Natural Language Processing, Budapest, pp. 75–82 (2003)Google Scholar
  3. 3.
    Courtois, B.: Un système de dictionnaires électroniques pour les mots simples du français. In: Langue Française, vol. 87. Larousse, Paris (1990)Google Scholar
  4. 4.
    Gross, M.: Lexicon-Grammar and the Syntactic Analysis of French. In: Proceedings of the 10th International Conference on Computational Linguistics (COLING 1984), Stanford, California (1984)Google Scholar
  5. 5.
    Gross, M.: The Construction of Local Grammars. In: Roche, E., Schabès, Y. (eds.) Finite-State Language Processing, Language, Speech, and Communication, pp. 329–354. MIT Press, Cambridge (1997)Google Scholar
  6. 6.
    Karttunen, Lauri, Chanod, J.-P., Grefenstette, G., Schiller, A.: Regular Expressions for Language Engineering. CUP Journals: Natural Language Engineering 2(4), 305–328 (1996)CrossRefGoogle Scholar
  7. 7.
    Maurel, D.: Reconnaissance de séquences de mots par automates, Adverbes de dates du français. PhD. thesis, Université Paris, Paris 7 (1989)Google Scholar
  8. 8.
    Maurel, D.: Building automaton on Schemata and Acceptability Tables. In: Raymond, D.R., Yu, S., Wood, D. (eds.) WIA 1996. LNCS, vol. 1260, pp. 72–86. Springer, Heidelberg (1997)Google Scholar
  9. 9.
    Mohri, M.: Syntactic Analysis by Local Grammars Automata: an Efficient Algorithm. In: Proceedings of COMPLEX 1994, Budapest, Hungary (1994)Google Scholar
  10. 10.
    Mohri, M., Pereira, F.C.N.: Dynamic compilation of weighted context-free grammars. In: 36th Annual Meeting of the ACL and 17th International Conference on Computational Linguistics, vol. 2, pp. 891–897 (1998)Google Scholar
  11. 11.
    Paumier, S.: De la reconnaissance de formes linguistiques à l’analyse syntaxique. PhD. thesis, Université de Marne-la-Vallée (2003)Google Scholar
  12. 12.
    Roche, E.: Une représentation par automate fini des textes et des propriétés transformationnelles des verbes. In: Lingvisticae Investigationes, vol. XVII(1), pp. 189–222. John Benjamins, Amsterdam (1993)Google Scholar
  13. 13.
    Roche, E., Schabes, Y.: Finite-State Language Processing, pp. 241–281. The MIT Press, Cambridge (1997)Google Scholar
  14. 14.
    Silberztein, M.D.: INTEX: a Finite State Transducer Toolbox. Theorical computer science 231(1), 33–46 (1999)CrossRefMathSciNetGoogle Scholar
  15. 15.
    Woods, W.A.: Transition Network Grammars for Natural Language Analysis. Communications of the ACM 13(10) (1970)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Matthieu Constant
    • 1
  • Denis Maurel
    • 2
  1. 1.Institut Gaspard MongeUniversité de Marne-la-ValléeFrance
  2. 2.Laboratoire d’InformatiqueUniversité François-Rabelais de ToursFrance

Personalised recommendations