Revised generalized phrase structure grammar

Authors:
Eric Sven Ristad
Affiliations:
M.I.T. Artificial Intelligence Lab, Cambridge, MA
Venue:
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Year:
1987

Citing 5
Cited 2

Computational Complexity and Natural Language

Computational Complexity and Natural Language
On the complexity of ID/LP parsing 1

Computational Linguistics
Computational complexity of current GPSG theory

ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Constraint propagation in Kimmo systems

ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
A simple reconstruction of GPSG

COLING '86 Proceedings of the 11th coference on Computational linguistics

Unification: a multidisciplinary survey

ACM Computing Surveys (CSUR)
Software support for practical grammar development

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, I revise generalized phrase structure grammar (GPSG) linguistic theory so that it is more tractable and linguistically constrained. Revised GPSG is also easier to understand, use, and implement. I provide an account of topicalization, explicative pronouns, and parasitic gaps in the revised system and conclude with suggestions for efficient parser design.