325 research outputs found
An alternative Gospel of structure: order, composition, processes
We survey some basic mathematical structures, which arguably are more
primitive than the structures taught at school. These structures are orders,
with or without composition, and (symmetric) monoidal categories. We list
several `real life' incarnations of each of these. This paper also serves as an
introduction to these structures and their current and potentially future uses
in linguistics, physics and knowledge representation.Comment: Introductory chapter to C. Heunen, M. Sadrzadeh, and E. Grefenstette.
Quantum Physics and Linguistics: A Compositional, Diagrammatic Discourse.
Oxford University Press, 201
Mathematical Foundations for a Compositional Distributional Model of Meaning
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.Comment: to appea
Lambek vs. Lambek: Functorial Vector Space Semantics and String Diagrams for Lambek Calculus
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 of sentences, given their grammatical structure in terms
of compositional type-logic, and given the empirically derived meanings of
their words. For the particular case that the meaning of words is modelled
within a distributional vector space model, its experimental predictions,
derived from real large scale data, have outperformed other empirically
validated methods that could build vectors for a full sentence. This success
can be attributed to a conceptually motivated mathematical underpinning, by
integrating qualitative compositional type-logic and quantitative modelling of
meaning within a category-theoretic mathematical framework.
The type-logic used in the DisCoCat model is Lambek's pregroup grammar.
Pregroup types form a posetal compact closed category, which can be passed, in
a functorial manner, on to the compact closed structure of vector spaces,
linear maps and tensor product. The diagrammatic versions of the equational
reasoning in compact closed categories can be interpreted as the flow of word
meanings within sentences. Pregroups simplify Lambek's previous type-logic, the
Lambek calculus, which has been extensively used to formalise and reason about
various linguistic phenomena. The apparent reliance of the DisCoCat on
pregroups has been seen as a shortcoming. This paper addresses this concern, by
pointing out that one may as well realise a functorial passage from the
original type-logic of Lambek, a monoidal bi-closed category, to vector spaces,
or to any other model of meaning organised within a monoidal bi-closed
category. The corresponding string diagram calculus, due to Baez and Stay, now
depicts the flow of word meanings.Comment: 29 pages, pending publication in Annals of Pure and Applied Logi
Interacting Frobenius Algebras are Hopf
Theories featuring the interaction between a Frobenius algebra and a Hopf
algebra have recently appeared in several areas in computer science: concurrent
programming, control theory, and quantum computing, among others. Bonchi,
Sobocinski, and Zanasi (2014) have shown that, given a suitable distributive
law, a pair of Hopf algebras forms two Frobenius algebras. Here we take the
opposite approach, and show that interacting Frobenius algebras form Hopf
algebras. We generalise (BSZ 2014) by including non-trivial dynamics of the
underlying object---the so-called phase group---and investigate the effects of
finite dimensionality of the underlying model. We recover the system of Bonchi
et al as a subtheory in the prime power dimensional case, but the more general
theory does not arise from a distributive law.Comment: 32 pages; submitte
Categorical Vector Space Semantics for Lambek Calculus with a Relevant Modality (Extended Abstract)
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 category with a coalgebra modality as defined on Differential
Categories. We instantiate this category to finite dimensional vector spaces
and linear maps via quantisation functors and work with three concrete
interpretations of the coalgebra modality. We apply the model to construct
categorical and concrete semantic interpretations for the motivating example of
this extended calculus: the derivation of a phrase with a parasitic gap. The
effectiveness of the concrete interpretations are evaluated via a
disambiguation task, on an extension of a sentence disambiguation dataset to
parasitic gap phrases, using BERT, Word2Vec, and FastText vectors and
Relational tensorsComment: In Proceedings ACT 2020, arXiv:2101.07888. arXiv admin note:
substantial text overlap with arXiv:2005.0307
- …