Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Lexical conceptual structure and machine translation
Lexical conceptual structure and machine translation
Computational properties of principle-based grammatical theories
Computational properties of principle-based grammatical theories
A parameterized parser for english and warlpiri
A parameterized parser for english and warlpiri
The computational difficulty of ID/LP parsing
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Category cooccurrence restrictions and the elimination of metarules
COLING '86 Proceedings of the 11th coference on Computational linguistics
| Hi-index | 0.00 |
In this paper we present a new parsing model of linguistic and computational interest. Linguistically, the relation between the parser and the theory of grammar adopted (Government and Binding (GB) theory as presented in Chomsky (1981, 1986a, b) is clearly specified. Computationally, this model adopts a mixed parsing procedure, by using left corner prediction in a modified LR parser.