NP-Completeness of Grammars Based Upon Products of Free Pregroups

DOI10.1007/978-3-642-54789-8_4zbMath1285.03022OpenAlexW945463313MaRDI QIDQ5414957

Denis Béchet

Publication date: 8 May 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54789-8_4

zbMATH Keywords

Lambek categorial grammarfree pregrouppregroup grammarproduct of pregroups

Mathematics Subject Classification ID

Logic of natural languages (03B65) Grammars and rewriting systems (68Q42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parsing pregroup grammars and Lambek calculus using partial composition
• The Mathematics of Sentence Structure
• Optional and Iterated Types for Pregroup Grammars
• Generalized Categorial Dependency Grammars

This page was built for publication: NP-Completeness of Grammars Based Upon Products of Free Pregroups