Formal languages
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Automata, Languages, and Machines
Automata, Languages, and Machines
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Computational complexity and lexical-functional grammar
Computational Linguistics
On parsing strategies and closure
ACL '80 Proceedings of the 18th annual meeting on Association for Computational Linguistics
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
Extended finite state models of language
Natural Language Engineering
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 3
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 3
Morphological Analyzer as Syntactic Parser
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Learning finite-state models for machine translation
Machine Learning
Finite-state methods and models in natural language processing
Natural Language Engineering
Regular growth automata: properties of a class of finitely induced infinite machines
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
| Hi-index | 0.00 |
The central claim of the paper is that NL stringsets are regular. Three independent arguments are offered in favor of this position: one based on parsimony considerations, one employing the McCullogh-Pitts (1943) model of neuruns, and a purely linguistic one. It is possible to derive explicit upper bounds for the number of (live) states in NL acceptors: the results show that finite state NL parsers can be implemented on present-day computers. The position of NL stringsets within the regular family is also investigated: it is proved that NLs are counter-free, but not locally testable.