Formal constraints on metarules

Authors:
Stuart M. Shieber;Susan U. Stucky;Hans Uszkoreit;Jane J. Robinson
Affiliations:
SRI International, Menlo Park, California;SRI International, Menlo Park, California;SRI International, Menlo Park, California;SRI International, Menlo Park, California
Venue:
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Year:
1983

Citing 1
Cited 4

Processing English with a Generalized Phrase Structure Grammar

ACL '82 Proceedings of the 20th annual meeting on Association for Computational Linguistics

On the mathematical properties of linguistic theories

Computational Linguistics - Special issue on mathematical properties of grammatical formalisms
On the mathematical properties of linguistic theories

ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Syntactic description of free word order languages

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Phrase structure grammars and natural languages

IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.01

Visualization

Abstract

Metagrammatical formalisms that combine context-free phrase structure rules and metarules (MPS grammars) allow concise statement of generalizations about the syntax of natural languages. Unconstrained MPS grammars, unfortunately, are not computationally "safe." We evaluate several proposals for constraining them, basing our assessment on computational tractability and explanatory adequacy. We show that none of them satisfies both criteria, and suggest new directions for research on alternative metagrammatical formalisms.