Skip to Main content Skip to Navigation
Conference papers

Compiling Linguistic Constraints into Finite State Automata

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-00637272
Contributor : Guillaume Blin <>
Submitted on : Monday, October 31, 2011 - 3:51:15 PM
Last modification on : Wednesday, February 26, 2020 - 7:06:06 PM
Long-term archiving on: : Wednesday, February 1, 2012 - 2:23:08 AM

File

fulltext.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00637272, version 1

Citation

Mathieu Constant, Denis Maurel. Compiling Linguistic Constraints into Finite State Automata. 11th International Conference on Implementation and Application of Automata (CIAA'06), Aug 2006, Taipei, Taiwan. pp.242-252. ⟨hal-00637272⟩

Share

Metrics

Record views

300

Files downloads

294