A faithful representation of non-associative Lambek grammars in abstract categorial grammars

DOI10.1007/S10849-009-9111-ZMaRDI QIDQ972436zbMATH OpenOpenAlexFDO

Authors Christian Retoré, S. Salvati

Publication date 26 May 2010

Published in Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/inria-00409557/file/nl_acg_retore_salvati_jolli.pdf

zbMATH Keywords

lambda calculuscategorial grammarformal language theory

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) Combinatory logic and lambda calculus (03B40)

Recommendations

• A note on the complexity of abstract categorial grammars
• On Two Extensions of Abstract Categorial Grammars
• scientific article; zbMATH DE number 68516
• On the expressive power of abstract categorial grammars: Representing context-free formalisms
• Logical Aspects of Computational Linguistics

Cites work

• scientific article; zbMATH DE number 42059 (Why is no real title available?)
• scientific article; zbMATH DE number 1998331 (Why is no real title available?)
• Derivational minimalism
• On the expressive power of abstract categorial grammars: Representing context-free formalisms
• The equivalence problem for deterministic MSO tree transducers is decidable
• The lambda calculus. Its syntax and semantics. Rev. ed.

Cited in

(9)

• \(k\)-valued non-associative Lambek grammars are learnable from generalized functor-argument structures
• Logical Aspects of Computational Linguistics
• A note on the complexity of abstract categorial grammars
• On the expressive power of abstract categorial grammars: Representing context-free formalisms
• Symmetric categorial grammar
• The Equivalence of Unidirectional Lambek Categorial Grammars and Context‐Free Grammars
• CoTAGs and ACGs
• On Two Extensions of Abstract Categorial Grammars
• On the membership problem for non-linear abstract categorial grammars

Describes a project that uses

Uses Software

• Grail
• Grail

This page was built for publication: A faithful representation of non-associative Lambek grammars in abstract categorial grammars

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