English
Related papers

Related papers: A Frobenius Algebraic Analysis for Parasitic Gaps

200 papers

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

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

The paper aims at emphasizing that, even relaxed, the hypothesis of compositionality has to face many problems when used for interpreting natural language texts. Rather than fixing these problems within the compositional framework, we…

Computation and Language · Computer Science 2007-05-23 Françoise Gayral , Daniel Kayser , François Lévy

The purpose of this short note is to fill a gap in the literature: Frobenius reciprocity in the theory of doctrines is closely related to modular connections in projective homological algebra and the notion of a principal element in…

Rings and Algebras · Mathematics 2025-09-29 Amartya Goswami , Zurab Janelidze , Graham Manuell

This paper presents and extends our type theoretical framework for a compositional treatment of natural language semantics with some lexical features like coercions (e.g. of a town into a football club) and copredication (e.g. on a town as…

Logic in Computer Science · Computer Science 2013-05-06 Christian Retoré

Lexical semantic typology has identified important cross-linguistic generalizations about the variation and commonalities in polysemy patterns---how languages package up meanings into words. Recent computational research has enabled…

Computation and Language · Computer Science 2020-06-04 Ella Rabinovich , Yang Xu , Suzanne Stevenson

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

Revealing the implicit semantic relation between the constituents of a noun-compound is important for many NLP applications. It has been addressed in the literature either as a classification task to a set of pre-defined relations or by…

Computation and Language · Computer Science 2018-05-08 Vered Shwartz , Ido Dagan

Due to the increased complexity of software development projects more and more systems are described by models. The sheer size makes it impractical to describe these systems by a single model. Instead many models are developed that provide…

Software Engineering · Computer Science 2014-09-24 Christoph Herrmann , Holger Krahn , Bernhard Rumpe , Martin Schindler , Steven Völkel

In this article we undertake a study of extension complexity from the perspective of formal languages. We define a natural way to associate a family of polytopes with binary languages. This allows us to define the notion of extension…

Computational Complexity · Computer Science 2019-08-29 Hans Raj Tiwary

Parametricity is a key metatheoretic property of type systems, which implies strong uniformity & modularity properties of the structure of types within systems possessing it. In recent years, various systems of dependent type theory have…

Logic in Computer Science · Computer Science 2024-12-18 C. B. Aberlé

In this paper, we study singular systems with complete sets of involutive constraints. The aim is to establish, within the Hamilton-Jacobi theory, the relationship between the Frobenius' theorem, the infinitesimal canonical transformations…

High Energy Physics - Theory · Physics 2015-06-22 M. C. Bertin , B. M. Pimentel , C. E. Valcárcel

One of the limitations of semantic parsing approaches to open-domain question answering is the lexicosyntactic gap between natural language questions and knowledge base entries -- there are many ways to ask a question, all with the same…

Computation and Language · Computer Science 2016-08-08 Shashi Narayan , Siva Reddy , Shay B. Cohen

This paper presents a semantic parsing approach for unrestricted texts. Semantic parsing is one of the major bottlenecks of Natural Language Understanding (NLU) systems and usually requires building expensive resources not easily portable…

Computation and Language · Computer Science 2007-05-23 Jordi Atserias , Irene Castellon , Montse Civit , German Rigau

In the present paper by Frobenius algebra Y we mean a finite dimensional algebra possessing an associative and invertible (nondegenerate) form a scalar product, referred to as the Frobenius structure. The nondegenerate form has an inverse.…

Rings and Algebras · Mathematics 2011-03-29 Zbigniew Oziewicz , Gregory Peter Wene

One of the central aspects of contextualised language models is that they should be able to distinguish the meaning of lexically ambiguous words by their contexts. In this paper we investigate the extent to which the contextualised…

Computation and Language · Computer Science 2021-09-30 Janosch Haber , Massimo Poesio

This paper considers parametricity and its consequent free theorems for nested data types. Rather than representing nested types via their Church encodings in a higher-kinded or dependently typed extension of System F, we adopt a functional…

Logic in Computer Science · Computer Science 2023-06-22 Patricia Johann , Enrico Ghiorzi

The Lambek calculus provides a foundation for categorial grammar in the form of a logic of concatenation. But natural language is characterized by dependencies which may also be discontinuous. In this paper we introduce the displacement…

Computation and Language · Computer Science 2010-04-26 Glyn Morrill , Oriol Valentín

We study the general theory of Frobenius algebras with group actions. These structures arise when one is studying the algebraic structures associated to a geometry stemming from a physical theory with a global finite gauge group, i.e.…

Algebraic Geometry · Mathematics 2007-05-23 Ralph M. Kaufmann

Based on the monoid classifier, we give an alternative axiomatization of Freyd's paracategories, which can be interpreted in any bicategory of partial maps. Assuming furthermore a free-monoid monad T in our ambient category, and…

Category Theory · Mathematics 2007-05-23 Claudio Hermida , Paulo Mateus