Pregroup Grammars, their Syntax and Semantics

09/23/2021
by   Mehrnoosh Sadrzadeh, et al.
0

Pregroup grammars were developed in 1999 and stayed Lambek's preferred algebraic model of grammar. The set-theoretic semantics of pregroups, however, faces an ambiguity problem. In his latest book, Lambek suggests that this problem might be overcome using finite dimensional vector spaces rather than sets. What is the right notion of composition in this setting, direct sum or tensor product of spaces?

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/15/2019

Vector spaces as Kripke frames

In recent years, the compositional distributional approach in computatio...
research
06/24/2018

A concrete categorical semantics of Lambda-S

Lambda-S is an extension to first-order lambda calculus unifying two app...
research
01/11/2019

Alternation diameter of a product object

We prove that every permutation of a Cartesian product of two finite set...
research
05/04/2019

A categorical construction for the computational definition of vector spaces

Lambda-S is an extension to first-order lambda calculus unifying two app...
research
01/14/2020

The geometry of syntax and semantics for directed file transformations

We introduce a conceptual framework that associates syntax and semantics...
research
05/04/2019

An experiment with denotational semantics

The paper is devoted to showing how to systematically design a programmi...
research
05/31/2022

Towards an Algebra of Computon Spaces

Compositionality is a key property for dealing with complexity, which ha...

Please sign up or login with your details

Forgot password? Click here to reset