Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
Courtois, B.: Un système de dictionnaires électroniques pour les mots simples du français. In: Langue Française, vol. 87. Larousse, Paris (1990)
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)
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)
Karttunen, Lauri, Chanod, J.-P., Grefenstette, G., Schiller, A.: Regular Expressions for Language Engineering. CUP Journals: Natural Language Engineering 2(4), 305–328 (1996)
Maurel, D.: Reconnaissance de séquences de mots par automates, Adverbes de dates du français. PhD. thesis, Université Paris, Paris 7 (1989)
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)
Mohri, M.: Syntactic Analysis by Local Grammars Automata: an Efficient Algorithm. In: Proceedings of COMPLEX 1994, Budapest, Hungary (1994)
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)
Paumier, S.: De la reconnaissance de formes linguistiques à l’analyse syntaxique. PhD. thesis, Université de Marne-la-Vallée (2003)
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)
Roche, E., Schabes, Y.: Finite-State Language Processing, pp. 241–281. The MIT Press, Cambridge (1997)
Silberztein, M.D.: INTEX: a Finite State Transducer Toolbox. Theorical computer science 231(1), 33–46 (1999)
Woods, W.A.: Transition Network Grammars for Natural Language Analysis. Communications of the ACM 13(10) (1970)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Constant, M., Maurel, D. (2006). Compiling Linguistic Constraints into Finite State Automata. In: Ibarra, O.H., Yen, HC. (eds) Implementation and Application of Automata. CIAA 2006. Lecture Notes in Computer Science, vol 4094. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11812128_23
Download citation
DOI: https://doi.org/10.1007/11812128_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37213-4
Online ISBN: 978-3-540-37214-1
eBook Packages: Computer ScienceComputer Science (R0)