Compiling linguistic constraints into finite state automata

Authors:
Matthieu Constant;Denis Maurel
Affiliations:
Institut Gaspard Monge, Université de Marne-la-Vallée, France;Laboratoire d’Informatique, Université François-Rabelais de Tours, France
Venue:
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Year:
2006

Citing 8
Cited 0

INTEX: an FST toolbox

Theoretical Computer Science - Special issue on implementing automata
Transition network grammars for natural language analysis

Communications of the ACM
Finite-State Language Processing

Finite-State Language Processing
On the Analysis of Locative Phrases with Graphs and Lexicon-Grammar: The Classifier/Proper Noun Pairing

PorTAL '02 Proceedings of the Third International Conference on Advances in Natural Language Processing
Building Automata on Schemata and Acceptability Tables: Application to French Data Adverbials

WIA '96 Revised Papers from the First International Workshop on Implementing Automata
Regular expressions for language engineering

Natural Language Engineering
Lexicon-grammar and the syntactic analysis of French

ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Dynamic compilation of weighted context-free grammars

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2

Quantified Score

Hi-index	0.00

Visualization

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.