Sources of Complexity in GPSG Theory

DOI10.1515/THLI.1986.13.1-2.105MaRDI QIDQ3780473zbMATH OpenOpenAlexFDO

Authors Eric Sven Ristad

Publication date 1986

Published in Theoretical Linguistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/thli.1986.13.1-2.105

zbMATH Keywords

context-free languagesgeneralized phrase structure grammarnatural language parsingNP-hardweak context-free generative power

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Natural language processing (68T50)

Recommendations

• Computational structure of GPSG models
• scientific article; zbMATH DE number 4098734
• On some formal properties of metarules
• Computational consequences of agreement and ambiguity in natural language
• scientific article; zbMATH DE number 108497

Cited in

(7)

• Polyadic dynamic logics for HPSG parsing
• Some formal properties of stratified feature grammars
• Computational consequences of agreement and ambiguity in natural language
• COMPUTATIONAL COMPLEXITY THEORY AND NATURAL LANGUAGE: A PARADOX RESOLVED
• Computational structure of GPSG models
• On some formal properties of metarules
• scientific article; zbMATH DE number 4098734 (Why is no real title available?)

This page was built for publication: Sources of Complexity in GPSG Theory

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