A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Compiling Linguistic Constraints into Finite State Automata
[chapter]
2006
Lecture Notes in Computer Science
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.
doi:10.1007/11812128_23
fatcat:7smggfm7nja4bhwoi726mi7tc4