A Savateev-style parsing algorithm for pregroup grammars

DOI10.1007/978-3-642-20169-1_9MaRDI QIDQ2999261zbMATHOpenAlexFDO

Authors Katarzyna Moroz

Publication date 11 May 2011

Published in Formal Grammar (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-20169-1_9

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Linear processing with pregroups
• Efficiency of pregroups and the French noun phrase
• Parsing pregroup grammars with letter promotions in polynomial time
• Learnability of pregroup grammars
• Toward discourse representation via pregroup grammars

Cited in

(2)

• Pregroup grammars with letter promotions: complexity and context-freeness
• scientific article; zbMATH DE number 7453972 (Why is no real title available?)

This page was built for publication: A Savateev-style parsing algorithm for pregroup grammars

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