Computational structure of GPSG models

DOI10.1007/BF00627292zbMath0708.68045OpenAlexW2006847768MaRDI QIDQ3490968

Eric Sven Ristad

Publication date: 1990

Published in: Linguistics and Philosophy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00627292

zbMATH Keywords

NP-completegeneralized phrase structure grammarsAND/OR nodesAND/OR tree

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Natural language processing (68T50) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

A Single Movement Normal Form for Minimalist Grammars

Cites Work

• Computational consequences of agreement and ambiguity in natural language
• Direct parsing of ID/LP grammars
• Sources of Complexity in GPSG Theory
• Alternation

This page was built for publication: Computational structure of GPSG models