Related papers: Conjunctive categorial grammars and Lambek grammars with additives

Conjunctive categorial grammars and Lambek grammars with additives

URL: http://arxiv.org/abs/2405.16662v1
Date: Sun, 26 May 2024 18:53:56 GMT
Title: Conjunctive categorial grammars and Lambek grammars with additives
Authors: Stepan L. Kuznetsov, Alexander Okhotin,
Abstract summary: A new family of categorial grammars is proposed, defined by enriching basic categorial grammars with a conjunction operation. It is also shown that categorial grammars with conjunction can be naturally embedded into the Lambek calculus with conjunction and disjunction operations.
Score: 49.1574468325115
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
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).

Related papers

Grammar Induction from Visual, Speech and Text [91.98797120799227]
This work introduces a novel visual-audio-text grammar induction task (textbfVAT-GI) Inspired by the fact that language grammar exists beyond the texts, we argue that the text has not to be the predominant modality in grammar induction. We propose a visual-audio-text inside-outside autoencoder (textbfVaTiora) framework, which leverages rich modal-specific and complementary features for effective grammar parsing.
arXiv Detail & Related papers (2024-10-01T02:24:18Z)
Grammar Equations [0.0]
In this paper we also provide wirings within words. This will enable us to identify grammatical constructs that we expect to be either equal or closely related. We give a nogo-theorem for the fact that our wirings for words make no sense for preordered monoids.
arXiv Detail & Related papers (2021-06-14T15:16:09Z)
VLGrammar: Grounded Grammar Induction of Vision and Language [86.88273769411428]
We study grounded grammar induction of vision and language in a joint learning framework. We present VLGrammar, a method that uses compound probabilistic context-free grammars (compound PCFGs) to induce the language grammar and the image grammar simultaneously.
arXiv Detail & Related papers (2021-03-24T04:05:08Z)
The Logic for a Mildly Context-Sensitive Fragment of the Lambek-Grishin Calculus [0.0]
We present a proof-theoretic characterization of tree-adjoining languages based on the Lambek-Grishin calculus. Several new techniques are introduced for the proofs, such as purely structural connectives, usefulness, and a graph-theoretic argument on proof nets for HLG.
arXiv Detail & Related papers (2021-01-10T22:28:05Z)
Lexically-constrained Text Generation through Commonsense Knowledge Extraction and Injection [62.071938098215085]
We focus on the Commongen benchmark, wherein the aim is to generate a plausible sentence for a given set of input concepts. We propose strategies for enhancing the semantic correctness of the generated text.
arXiv Detail & Related papers (2020-12-19T23:23:40Z)
ConjNLI: Natural Language Inference Over Conjunctive Sentences [89.50542552451368]
Reasoning about conjuncts in conjunctive sentences is important for a deeper understanding of conjunctions. Existing NLI stress tests do not consider non-boolean usages of conjunctions. We introduce ConjNLI, a challenge stress-test for natural language inference over conjunctive sentences.
arXiv Detail & Related papers (2020-10-20T16:29:13Z)
Montague Grammar Induction [4.321645312120979]
This framework provides the analyst fine-grained control over the assumptions that the induced grammar should conform to. We focus on the relationship between s(emantic)-selection and c(ategory)-selection, using as input a lexicon-scale acceptability judgment dataset.
arXiv Detail & Related papers (2020-10-15T23:25:01Z)
Logical foundations for hybrid type-logical grammars [0.0]
This paper explores proof-theoretic aspects of hybrid type-logical grammars. We prove some basic properties of the calculus, such as normalisation and the subformula property. We present both a sequent and a proof net calculus for hybrid type-logical grammars.
arXiv Detail & Related papers (2020-09-22T08:26:14Z)
Syn-QG: Syntactic and Shallow Semantic Rules for Question Generation [49.671882751569534]
We develop SynQG, a set of transparent syntactic rules which transform declarative sentences into question-answer pairs. We utilize PropBank argument descriptions and VerbNet state predicates to incorporate shallow semantic content. In order to improve syntactic fluency and eliminate grammatically incorrect questions, we employ back-translation over the output of these syntactic rules.
arXiv Detail & Related papers (2020-04-18T19:57:39Z)
Traduction des Grammaires Cat\'egorielles de Lambek dans les Grammaires Cat\'egorielles Abstraites [0.0]
This internship report is to demonstrate that every Lambek Grammar can be, not entirely but efficiently, expressed in Abstract Categorial Grammars (ACG) The main idea is to transform the type rewriting system of LGs into that of Context-Free Grammars (CFG) by erasing introduction and elimination rules and generating enough axioms so that the cut rule suffices. Although the underlying algorithm was not fully implemented, this proof provides another argument in favour of the relevance of ACGs in Natural Language Processing.
arXiv Detail & Related papers (2020-01-23T18:23:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.