Bounded context syntactic analysis
Communications of the ACM
Theory of Syntactic Recognition for Natural Languages
Theory of Syntactic Recognition for Natural Languages
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Extended access to the left context in an ATN parser
EACL '83 Proceedings of the first conference on European chapter of the Association for Computational Linguistics
Generalized memory manipulating actions for parsing natural language
COLING '86 Proceedings of the 11th coference on Computational linguistics
Hi-index | 0.00 |
A central goal of linguistic theory is to explain why natural languages are the way they are. It has often been supposed that computational considerations ought to play a role in this characterization, but rigorous arguments along these lines have been difficult to come by. In this paper we show how a key "axiom" of certain theories of grammar, Subjacency, can be explained by appealing to general restrictions on on-line parsing plus natural constraints on the rule-writing vocabulary of grammars. The explanation avoids the problems with Marcus' [1980] attempt to account for the same constraint. The argument is robust with respect to machine implementation, and thus avoids the problems that often arise when making detailed claims about parsing efficiency. It has the added virtue of unifying in the functional domain of parsing certain grammatically disparate phenomena, as well as making a strong claim about the way in which the grammar is actually embedded into an on-line sentence processor.