pith. machine review for the scientific record. sign in

arxiv: 1003.4394 · v1 · submitted 2010-03-23 · 💻 cs.CL · cs.LO· math.CT

Recognition: unknown

Mathematical Foundations for a Compositional Distributional Model of Meaning

Authors on Pith no claims yet
classification 💻 cs.CL cs.LOmath.CT
keywords meaningmeaningsmathematicalsentencedistributionalmodelwholecompositional
0
0 comments X
read the original abstract

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 Lambek. This mathematical framework enables us to compute the meaning of a well-typed sentence from the meanings of its constituents. Concretely, the type reductions of Pregroups are `lifted' to morphisms in a category, a procedure that transforms meanings of constituents into a meaning of the (well-typed) whole. Importantly, meanings of whole sentences live in a single space, independent of the grammatical structure of the sentence. Hence the inner-product can be used to compare meanings of arbitrary sentences, as it is for comparing the meanings of words in the distributional model. The mathematical structure we employ admits a purely diagrammatic calculus which exposes how the information flows between the words in a sentence in order to make up the meaning of the whole sentence. A variation of our `categorical model' which involves constraining the scalars of the vector spaces to the semiring of Booleans results in a Montague-style Boolean-valued semantics.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A Rigid Category of DNA Secondary Structures

    math.CT 2026-05 accept novelty 7.0

    A rigid monoidal category is constructed with DNA sequences as objects and non-pseudoknotted secondary structures as morphisms via planar matchings.

  2. String Diagrams for Quantum Foundations, Computing and Natural Language Processing

    quant-ph 2026-05 unverdicted novelty 6.0

    String diagrams formalize constructor theory with locality-composition conflicts, enable wave-based Boolean logic design and optimization, and map Urdu text circuits equivalently to English ones up to gate translation...