Transition network grammars for natural language analysis
Communications of the ACM
Theory of Syntactic Recognition for Natural Languages
Theory of Syntactic Recognition for Natural Languages
Natural Language Communication with Computers
Toward A Principle-Based Parser
Toward A Principle-Based Parser
Computational Linguistics
New frontiers beyond context-freeness: DI-grammars and DI-automata
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
A PARLOG implementation of Government-Binding Theory
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
A new design of prolog-based bottom-up parsing system with Government-Binding theory
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
A logic-based Government-Binding parser for Mandarin Chinese
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
| Hi-index | 0.00 |
A parser formalism for natural languages that is so restricted as to rule out the definition of linguistic structures that do not occur in any natural language can make the task of grammar construction easier, whether it is done manually (by a programmer) or automatically (by a grammar induction system). A restrictive grammar formalism for logic programming languages is presented that imposes some of the constraints suggested by recent Chomskian linguistic theory. In spite of these restrictions, this formalism allows for relatively elegant characterizations of natural languages that can be translated into efficient prolog parsers.