Minimization of rational word functions
SIAM Journal on Computing
Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Deterministic part-of-speech tagging with finite-state transducers
Computational Linguistics
Factorization of Ambiguous Finite-State Transducers
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Tagging French: comparing a statistical and a constraint-based method
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Comparing a linguistic and a stochastic tagger
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Constraint grammar as a framework for parsing running text
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Compiling and using finite-state syntactic rules
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Parallel replacement in finite state calculus
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Finite-state parsing and disambiguation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Foma: a finite-state compiler and library
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: Demonstrations Session
The proper treatment of optimality in computational phonology: plenary talk
FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing
| Hi-index | 0.00 |
We propose an approach to parsing Constraint Grammars using finite-state transducers and report on a compiler that converts Constraint Grammar rules into transducer representations. The resulting transducers are further optimized by conversion to left and right sequential transducers. Using the method, we show that we can improve on the worst-case asymptotic bound of Constraint Grammar parsing from cubic to quadratic in the length of input sentences.