Extending free pregroups with lower bounds

DOI10.1007/S11225-010-9264-4zbMATH Open1228.03013OpenAlexW2004877903MaRDI QIDQ993496FDOQ993496

Tamar Aizikowitz, Michael Kaminski, Daniel Genkin, Nissim Francez

Publication date: 20 September 2010

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-010-9264-4

Recommendations

• Extended pregroup grammars applied to natural languages
• Fully Lexicalized Pregroup Grammars
• scientific article; zbMATH DE number 1786547
• A modular and parameterized presentation of pregroup calculus
• From word to sentence. A computational algebraic approach to grammar

zbMATH Keywords

pregroup grammarsnatural languageformal language theorytype-logical grammars

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Logic of natural languages (03B65) Grammars and rewriting systems (68Q42) Algebraic theory of languages and automata (68Q70) Other algebras related to logic (03G25) Ordered structures (06F99) Natural language processing (68T50)

Cites Work

• Title not available (Why is that?)
• DECIDABILITY OF THE UNIVERSAL AND POSITIVE THEORIES OF A FREE GROUP
• Complexity of Makanin's algorithm
• Title not available (Why is that?)
• EQUATIONS IN A FREE GROUP
• Commutation-augmented pregroup grammars and mildly context-sensitive languages
• Title not available (Why is that?)

Cited In (3)

• Pregroups and natural language processing
• Title not available (Why is that?)
• Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars

This page was built for publication: Extending free pregroups with lower bounds

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