Formal constraints on metarules

DSpace/Manakin Repository

Formal constraints on metarules

Citable link to this page


Title: Formal constraints on metarules
Author: Shieber, Stuart; Robinson, Jane J.; Stucky, Susan U.; Uszkoreit, Hans

Note: Order does not necessarily reflect citation order of authors.

Citation: Stuart M. Shieber, Susan U. Stucky, Hans Uszkoreit, and Jane J. Robinson. Formal constraints on metarules. In Proceedings of the 21st Annual Meeting of the Association for Computational Linguistics, pages 22-27, Massachusetts Institute of Technology, Cambridge, Massachusetts, June 15-17 1983.
Full Text & Related Files:
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.
Published Version:
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at
Citable link to this page:

Show full Dublin Core record

This item appears in the following Collection(s)

  • FAS Scholarly Articles [8094]
    Peer reviewed scholarly articles from the Faculty of Arts and Sciences of Harvard University

Search DASH

Advanced Search