1. Conjunctive categorial grammars and Lambek grammars with additives
- Author
-
Kuznetsov, Stepan L. and Okhotin, Alexander
- Subjects
Computer Science - Logic in Computer Science ,Computer Science - Computation and Language ,Mathematics - Logic ,03D05 ,F.4.2 ,F.4.1 - Abstract
A new family of categorial grammars is proposed, defined by enriching basic categorial grammars with a conjunction operation. It is proved that the formalism obtained in this way has the same expressive power as conjunctive grammars, that is, context-free grammars enhanced with conjunction. It is also shown that categorial grammars with conjunction can be naturally embedded into the Lambek calculus with conjunction and disjunction operations. This further implies that a certain NP-complete set can be defined in the Lambek calculus with conjunction. We also show how to handle some subtle issues connected with the empty string. Finally, we prove that a language generated by a conjunctive grammar can be described by a Lambek grammar with disjunction (but without conjunction)., Comment: This article is an extended version of the conference presentation "Conjunctive categorial grammars" at the Mathematics of Language 2017 meeting (London, UK, July 13-14, 2017; proceedings published in ACL Anthology, W17-3414)
- Published
- 2024