Reference. A generalised quantifier theory of natural language in categorical compositional distributional semantics with bialgebras

Categorical compositional distributional semantics is a model of natural language; it combines the statistical vector space models of words with the compositional models of grammar. We formalise in this model the generalised quantifier theory of natural language, due to Barwise and Cooper. The underlying setting is a compact closed category with bialgebras. We start from a generative grammar formalisation and develop an abstract categorical compositional semantics for it, and then instantiate the abstract setting to sets and relations and to finite-dimensional vector spaces and linear maps. We prove the equivalence of the relational instantiation to the truth theoretic semantics of generalised quantifiers. The vector space instantiation formalises the statistical usages of words and enables us to, for the first time, reason about quantified phrases and sentences compositionally in distributional semantics.

Cite

Cite as @hedges-2019-a (helia, typst) · \cite{hedges-2019-a} (LaTeX)
BibTeX
bibtex · 1 line
@article{hedges-2019-a, title={A generalised quantifier theory of natural language in categorical compositional distributional semantics with bialgebras}, volume={29}, ISSN={1469-8072}, url={http://dx.doi.org/10.1017/s0960129518000324}, DOI={10.1017/s0960129518000324}, number={06}, journal={Mathematical Structures in Computer Science}, publisher={Cambridge University Press (CUP)}, author={Hedges, Jules and Sadrzadeh, Mehrnoosh}, year={2019}, month=Apr, pages={783–809} }
hayagriva YAML (typst)
yaml · 18 lines
hedges-2019-a:
  type: article
  title: A generalised quantifier theory of natural language in categorical compositional distributional semantics with bialgebras
  author:
  - Hedges, Jules
  - Sadrzadeh, Mehrnoosh
  date: 2019-04
  page-range: 783-809
  url: http://dx.doi.org/10.1017/s0960129518000324
  serial-number:
    doi: 10.1017/s0960129518000324
    issn: 1469-8072
  parent:
    type: periodical
    title: Mathematical Structures in Computer Science
    publisher: Cambridge University Press (CUP)
    issue: '06'
    volume: 29
Cites 55 works (2 here)
With notes (2)

The mathematics of sentence structure lambek58

DOI

Three models for the description of language chomThreeModels1956

We investigate several conceptions of linguistic structure to determine whether or not they can provide simple and “revealing” grammars that generate all of the sentences of English and only these. We find that no finite-state Markov process that produces symbols with transition from state to state can serve as an English grammar. Furthermore, the particular subclass of such processes that produce n-order statistical approximations to English do not come closer, with increasing n, to matching the output of an English grammar. We formalize the notions of “phrase structure” and show that this gives us a method for describing language which is essentially more powerful, though still representable as a rather elementary type of finite-state process. Nevertheless, it is successful only when limited to a small subset of simple sentences. We study the formal properties of a set of grammatical transformations that carry sentences with phrase structure into new sentences with derived phrase structure, showing that transformational grammars are processes of the same elementary type as phrase-structure grammars; that the grammar of English is materially simplified if phrase structure description is limited to a kernel of simple sentences from which all other sentences are constructed by repeated transformations; and that this view of linguistic structure gives a certain insight into the use and understanding of language.
DOI
External (53)
hedges-2019-a reference entries/refs/hedges-2019-a/hedges-2019-a.hel