Paper: Formal Constraints On Metarules

ACL ID P83-1004
Title Formal Constraints On Metarules
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1983

Metagrammaticai formalisms that combine context-free phrase structure rules and metarules (MPS grammars) allow con- cise statement of generalizations about the syntax of natural lan- guages. Unconstrained MPS grammars, tmfortunately, are not cornputationally "safe". We evaluate several proposals for con- straining them, basing our amae~ment on computational trac- tability and explanatory adequacy. We show that none of them satisfies both criteria, and suggest new directions for research on alternative metagrammatical formalisms.