Computational structure of GPSG models

DOI10.1007/BF00627292MaRDI QIDQ3490968zbMATH OpenOpenAlexFDO

Authors 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

AND/OR nodesAND/OR treegeneralized phrase structure grammarsNP-complete

Mathematics Subject Classification ID

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

Recommendations

• Sources of Complexity in GPSG Theory
• scientific article; zbMATH DE number 4098734
• Computational complexity of syntactic agreement and lexical ambiguity
• scientific article; zbMATH DE number 907954
• scientific article; zbMATH DE number 1560216

Cites work

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

Cited in

(8)

• Polyadic dynamic logics for HPSG parsing
• Computational complexity of probabilistic disambiguation
• Computational complexity of syntactic agreement and lexical ambiguity
• A Single Movement Normal Form for Minimalist Grammars
• On some formal properties of metarules
• Sources of Complexity in GPSG Theory
• scientific article; zbMATH DE number 1560216 (Why is no real title available?)
• Three models for the description of language

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3490968)