#14714The extension is shown to be parseable by a simple extension to an existing parsing method for GPSG.Metagrammatical formalisms that combine context-free phrase structure rules and metarules (MPS grammars) allow concise statement of generalizations about the syntax of natural languages.
lr,0-2-P83-1004,ak
</term>
of
<term>
natural languages
</term>
.
<term>
Unconstrained MPS grammars
</term>
, unfortunately , are not computationally
#14740Metagrammatical 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.
other,18-4-P83-1004,ak
directions for research on alternative
<term>
metagrammatical formalisms
</term>
. By exploring the relationship between
#14787We show that none of them satisfies both criteria, and suggest new directions for research on alternativemetagrammatical formalisms.
other,15-3-P83-1004,ak
computational tractability
</term>
and
<term>
explanatory adequacy
</term>
. We show that none of them satisfies
#14766We evaluate several proposals for constraining them, basing our assessment on computational tractability andexplanatory adequacy.
lr,4-1-P83-1004,ak
Metagrammatical formalisms
</term>
that combine
<term>
context-free phrase structure rules and metarules ( MPS grammars )
</term>
allow concise statement of
<term>
generalizations
#14718Metagrammatical formalisms that combinecontext-free phrase structure rules and metarules ( MPS grammars ) allow concise statement of generalizations about the syntax of natural languages.
other,18-1-P83-1004,ak
)
</term>
allow concise statement of
<term>
generalizations
</term>
about the
<term>
syntax
</term>
of
<term>
#14732Metagrammatical formalisms that combine context-free phrase structure rules and metarules (MPS grammars) allow concise statement ofgeneralizations about the syntax of natural languages.
other,23-1-P83-1004,ak
</term>
about the
<term>
syntax
</term>
of
<term>
natural languages
</term>
.
<term>
Unconstrained MPS grammars
#14737Metagrammatical formalisms that combine context-free phrase structure rules and metarules (MPS grammars) allow concise statement of generalizations about the syntax ofnatural languages.
other,12-3-P83-1004,ak
constraining them , basing our assessment on
<term>
computational tractability
</term>
and
<term>
explanatory adequacy
</term>
#14763We evaluate several proposals for constraining them, basing our assessment oncomputational tractability and explanatory adequacy.
other,21-1-P83-1004,ak
<term>
generalizations
</term>
about the
<term>
syntax
</term>
of
<term>
natural languages
</term>
.
#14735Metagrammatical formalisms that combine context-free phrase structure rules and metarules (MPS grammars) allow concise statement of generalizations about thesyntax of natural languages.