Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
FSA Utilities: A Toolbox to Manipulate Finite-State Automata
WIA '96 Revised Papers from the First International Workshop on Implementing Automata
The recognition capacity of local syntactic constraints
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Using restriction to extend parsing algorithms for complex-feature-based formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Finite-state approximation of phrase structure grammars
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Compiling a partition-based two-level formalism
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Parallel replacement in finite state calculus
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Practical experiments with regular approximation of context-free languages
Computational Linguistics - Special issue on finite-state methods in NLP
Treatment of epsilon moves in subset construction
Computational Linguistics - Special issue on finite-state methods in NLP
Multitiered nonlinear morphology using multitape finite automata: a case study on Syriac and Arabic
Computational Linguistics - Special issue on finite-state methods in NLP
Dependency Parsing with an Extended Finite-State Approach
Computational Linguistics
Context-free parsing through regular approximation
FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing
Treatment of ε-moves in subset construction
FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing
Regular approximation of link grammar
FinTAL'06 Proceedings of the 5th international conference on Advances in Natural Language Processing
| Hi-index | 0.00 |
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least context-free complexity, for applications such as speech processing in which speed is important finite-state models are often preferred. These requirements may be reconciled by using the more complex grammar to automatically derive a finite-state approximation which can then be used as a filter to guide speech recognition or to reject many hypotheses at an early stage of processing. A method is presented here for calculating such finite-state approximations from context-free grammars. It is essentially different from the algorithm introduced by Pereira and Wright (1991; 1996), is faster in some cases, and has the advantage of being open-ended and adaptable.