Logical Aspects of Computational Linguistics

DOI10.1007/B136076MaRDI QIDQ5706925zbMATH OpenOpenAlexFDO

Authors Denis Béchet, Annie Foret

Publication date 23 November 2005

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

Full work available at URL https://doi.org/10.1007/b136076

Mathematics Subject Classification ID

Logic of natural languages (03B65) Grammars and rewriting systems (68Q42) Natural language processing (68T50)

Recommendations

• \(k\)-valued non-associative Lambek grammars are learnable from generalized functor-argument structures
• K-valued non-associative Lambek grammars are learnable from function-argument structures
• scientific article; zbMATH DE number 1998331
• A faithful representation of non-associative Lambek grammars in abstract categorial grammars
• Categorial grammars with iterated types form a strict hierarchy of \(k\)-valued languages
• Categorial grammars with iterated types form a strict hierarchy of \(k\)-valued languages
• The equivalence of Nonassociative Lambek Categorial Grammars and Context-Free Grammars
• Non‐associative Lambek Categorial Grammar in Polynomial Time
• scientific article; zbMATH DE number 2219787
• Product-free Lambek calculus and context-free grammars

Cited in

(4)

• \(k\)-valued non-associative Lambek grammars are learnable from generalized functor-argument structures
• Categorial grammars with iterated types form a strict hierarchy of \(k\)-valued languages
• The emptiness of intersection problem for languages of \(k\)-valued categorial grammars (classical and Lambek) is undecidable
• Categorial grammars with iterated types form a strict hierarchy of \(k\)-valued languages

This page was built for publication: Logical Aspects of Computational Linguistics

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