English
Related papers

Related papers: Pregroup Grammars, their Syntax and Semantics

200 papers

We propose a mathematical framework for a unification of the distributional theory of meaning in terms of vector space models, and a compositional theory for grammatical types, for which we rely on the algebra of Pregroups, introduced by…

Computation and Language · Computer Science 2010-03-24 Bob Coecke , Mehrnoosh Sadrzadeh , Stephen Clark

The Distributional Compositional Categorical (DisCoCat) model is a mathematical framework that provides compositional semantics for meanings of natural language sentences. It consists of a computational procedure for constructing meanings…

Logic · Mathematics 2013-06-21 Bob Coecke , Edward Grefenstette , Mehrnoosh Sadrzadeh

"Spider" is a nickname of special Frobenius algebras, a fundamental structure from mathematics, physics, and computer science. Pregroups are a fundamental structure from linguistics. Pregroups and spiders have been used together in natural…

Category Theory · Mathematics 2024-08-07 Dusko Pavlovic

We develop a vector space semantics for Lambek Calculus with Soft Subexponentials, apply the calculus to construct compositional vector interpretations for parasitic gap noun phrases and discourse units with anaphora and ellipsis, and…

Logic in Computer Science · Computer Science 2023-10-09 Lachlan McPheat , Hadi Wazni , Mehrnoosh Sadrzadeh

We consider tensor grammars, which are an example of \commutative" grammars, based on the classical (rather than intuitionistic) linear logic. They can be seen as a surface representation of abstract categorial grammars ACG in the sense…

Logic · Mathematics 2021-11-22 Sergey Slavnov

In recent years, the compositional distributional approach in computational linguistics has opened the way for an integration of the \emph{lexical} aspects of meaning into Lambek's type-logical grammar program. This approach is based on the…

Logic in Computer Science · Computer Science 2021-05-13 Giuseppe Greco , Fei Liang , Michael Moortgat , Alessandra Palmigiano , Apostolos Tzimoulis

A prototypical example of categorial grammars are those based on Lambek calculus, i.e. noncommutative intuitionistic linear logic. However, it has been noted that purely noncommutative operations are often not sufficient for modeling even…

Logic · Mathematics 2025-07-16 Sergey Slavnov

In categorical compositional semantics of natural language one studies functors from a category of grammatical derivations (such as a Lambek pregroup) to a semantic category (such as real vector spaces). We compositionally build…

Logic in Computer Science · Computer Science 2018-11-09 Jules Hedges , Martha Lewis

We present basic notions of Gold's "learnability in the limit" paradigm, first presented in 1967, a formalization of the cognitive process by which a native speaker gets to grasp the underlying grammar of his/her own native language by…

Machine Learning · Computer Science 2009-09-29 Roberto Bonato

We construct new examples of non-nil algebras with any number of generators, which are direct sums of two locally nilpotent subalgebras. As all previously known examples, our examples are contracted semigroup algebras and the underlying…

Rings and Algebras · Mathematics 2007-05-23 Vesselin Drensky , Lakhdar Hammoudi

We use Lambek's pregroups and the framework of compositional distributional models of language ("DisCoCat") to study translations from Japanese to English as pairs of functors. Adding decorations to pregroups we show how to handle word…

Computation and Language · Computer Science 2023-08-01 Valentin Boboc

Recent work on vector-based compositional natural language semantics has proposed the use of density matrices to model lexical ambiguity and (graded) entailment (e.g. Piedeleu et al 2015, Bankova et al 2019, Sadrzadeh et al 2018). Ambiguous…

Computation and Language · Computer Science 2020-11-06 Adriana D. Correia , Michael Moortgat , Henk T. C. Stoof

In addition to their limpid interface with semantics, categorial grammars enjoy another important property: learnability. This was first noticed by Buskowsky and Penn and further studied by Kanazawa, for Bar-Hillel categorial grammars. What…

Machine Learning · Computer Science 2013-10-03 Roberto Bonato , Christian Retoré

Extended versions of the Lambek Calculus currently used in computational linguistics rely on unary modalities to allow for the controlled application of structural rules affecting word order and phrase structure. These controlled structural…

Computation and Language · Computer Science 2021-09-07 Adriana D. Correia , Henk T. C. Stoof , Michael Moortgat

These are lecture notes on the algebraic approach to regular languages. The classical algebraic approach is for finite words; it uses semigroups instead of automata. However, the algebraic approach can be extended to structures beyond…

Formal Languages and Automata Theory · Computer Science 2020-08-27 Mikołaj Bojańczyk

We introduce the logical grammar emdebbing (LGE), a model inspired by pregroup grammars and categorial grammars to enable unsupervised inference of lexical categories and syntactic rules from a corpus of text. LGE produces comprehensible…

Computation and Language · Computer Science 2023-06-07 Sean Deyo , Veit Elser

Compact closed categories have found applications in modeling quantum information protocols by Abramsky-Coecke. They also provide semantics for Lambek's pregroup algebras, applied to formalizing the grammatical structure of natural…

Computation and Language · Computer Science 2014-05-13 Dimitri Kartsaklis , Mehrnoosh Sadrzadeh , Stephen Pulman , Bob Coecke

This paper presents a model for linguistic description based on group theory. A grammar in this model, or "G-grammar", is a collection of lexical expressions which are products of logical forms, phonological forms, and their inverses.…

cmp-lg · Computer Science 2007-05-23 Marc Dymetman

We develop a categorical compositional distributional semantics for Lambek Calculus with a Relevant Modality, which has a limited version of the contraction and permutation rules. The categorical part of the semantics is a monoidal biclosed…

Logic in Computer Science · Computer Science 2021-01-27 Lachlan McPheat , Mehrnoosh Sadrzadeh , Hadi Wazni , Gijs Wijnholds

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…

Logic in Computer Science · Computer Science 2024-05-28 Stepan L. Kuznetsov , Alexander Okhotin
‹ Prev 1 2 3 10 Next ›