other,0-1-P83-1004,ak The extension is shown to be parseable by a simple extension to an existing <term> parsing method </term> for <term> GPSG </term> . <term> Metagrammatical formalisms </term> that combine <term> context-free phrase structure rules and metarules ( MPS grammars ) </term> allow concise statement of <term> generalizations </term> about the <term> syntax </term> of <term> natural languages </term> .
lr,4-1-P83-1004,ak <term> Metagrammatical formalisms </term> that combine <term> context-free phrase structure rules and metarules ( MPS grammars ) </term> allow concise statement of <term> generalizations </term> about the <term> syntax </term> of <term> natural languages </term> .
other,18-1-P83-1004,ak <term> Metagrammatical formalisms </term> that combine <term> context-free phrase structure rules and metarules ( MPS grammars ) </term> allow concise statement of <term> generalizations </term> about the <term> syntax </term> of <term> natural languages </term> .
other,21-1-P83-1004,ak <term> Metagrammatical formalisms </term> that combine <term> context-free phrase structure rules and metarules ( MPS grammars ) </term> allow concise statement of <term> generalizations </term> about the <term> syntax </term> of <term> natural languages </term> .
other,23-1-P83-1004,ak <term> Metagrammatical formalisms </term> that combine <term> context-free phrase structure rules and metarules ( MPS grammars ) </term> allow concise statement of <term> generalizations </term> about the <term> syntax </term> of <term> natural languages </term> .
lr,0-2-P83-1004,ak <term> Metagrammatical formalisms </term> that combine <term> context-free phrase structure rules and metarules ( MPS grammars ) </term> allow concise statement of <term> generalizations </term> about the <term> syntax </term> of <term> natural languages </term> . <term> Unconstrained MPS grammars </term> , unfortunately , are not computationally safe .
other,12-3-P83-1004,ak We evaluate several proposals for constraining them , basing our assessment on <term> computational tractability </term> and <term> explanatory adequacy </term> .
other,15-3-P83-1004,ak We evaluate several proposals for constraining them , basing our assessment on <term> computational tractability </term> and <term> explanatory adequacy </term> .
other,18-4-P83-1004,ak We show that none of them satisfies both criteria , and suggest new directions for research on alternative <term> metagrammatical formalisms </term> .
hide detail