English
Related papers

Related papers: Anaphora and Ellipsis in Lambek Calculus with a Re…

200 papers

A hybrid methodology for the resolution of text-level ellipsis is presented in this paper. It incorporates conceptual proximity criteria applied to ontologically well-engineered domain knowledge bases and an approach to centering based on…

cmp-lg · Computer Science 2008-02-03 Michael Strube , Udo Hahn

In typical non-idempotent intersection type systems, proof normalization is not confluent. In this paper we introduce a confluent non-idempotent intersection type system for the lambda-calculus. Typing derivations are presented using proof…

Logic in Computer Science · Computer Science 2019-07-23 Pablo Barenbaum , Gonzalo Ciruelos

The paper describes a parser for Categorial Grammar which provides fully word by word incremental interpretation. The parser does not require fragments of sentences to form constituents, and thereby avoids problems of spurious ambiguity.…

cmp-lg · Computer Science 2016-08-31 David Milward

Lambek's non-associative syntactic calculus (NL) excels in its resource consciousness: the usual structural rules for weakening, contraction, exchange and even associativity are all dropped. Recently, there have been proposals for…

Logic in Computer Science · Computer Science 2011-06-03 Arno Bastenhof

Algebraic lambda-calculi have been studied in various ways, but their semantics remain mostly untouched. In this paper we propose a semantic analysis of a general simply-typed lambda-calculus endowed with a structure of vector space. We…

Logic in Computer Science · Computer Science 2010-06-09 Benoît Valiron

This paper shows connections between command injection attacks, continuations, and the Lambek calculus: certain command injections, such as the tautology attack on SQL, are shown to be a form of control effect that can be typed using the…

Programming Languages · Computer Science 2016-06-22 Hayo Thielecke

The multimodal Lambek calculus is an extension of the Lambek calculus that includes several product operations (some of them being commutative or/and associative), unary modalities, and corresponding residual implications. In this work, we…

Logic in Computer Science · Computer Science 2023-08-10 Tikhon Pshenitsyn

We demonstrate a method of associating the principal symbol at a $K$-point with a linear differential operator acting between modules over a commutative algebra, and we use it to define the ellipticity of a linear differential operator in a…

Commutative Algebra · Mathematics 2018-03-23 Sławomir Kapka

We investigate the extent to which compositional vector space models can be used to account for scope ambiguity in quantified sentences (of the form "Every man loves some woman"). Such sentences containing two quantifiers introduce two…

Computation and Language · Computer Science 2018-10-26 Gijs Jasper Wijnholds

An embedding is a function that maps entities from one algebraic structure into another while preserving certain characteristics. Embeddings are being used successfully for mapping relational data or text into vector spaces where they can…

Artificial Intelligence · Computer Science 2019-02-28 Maxat Kulmanov , Wang Liu-Wei , Yuan Yan , Robert Hoehndorf

We investigate the relationship between finite terms in {\lambda}-letrec, the {\lambda}-calculus with letrec, and the infinite {\lambda}-terms they express. We say that a lambda-letrec term expresses a lambda-term if the latter can be…

Programming Languages · Computer Science 2016-10-20 Jan Rochel

Distributional semantics creates vector-space representations that capture many forms of semantic similarity, but their relation to semantic entailment has been less clear. We propose a vector-space model which provides a formal foundation…

Computation and Language · Computer Science 2016-07-14 James Henderson , Diana Nicoleta Popa

In this paper, we consider the full Lambek calculus enriched with subexponential modalities in a distributive setting. We show that the distributive Lambek calculus with subexponentials is complete with respect to its Kripke frames via…

Logic in Computer Science · Computer Science 2023-08-10 Daniel Rogozin

Categorical compositional distributional model of Coecke et al. (2010) suggests a way to combine grammatical composition of the formal, type logical models with the corpus based, empirical word representations of distributional semantics.…

Computation and Language · Computer Science 2015-10-15 Esma Balkir , Mehrnoosh Sadrzadeh , Bob Coecke

In the quest to give a formal compositional semantics to natural languages, semanticists have started turning their attention to phenomena that have been also considered as parts of pragmatics (e.g., discourse anaphora and presupposition…

Computation and Language · Computer Science 2015-06-19 Jiri Marsik , Maxime Amblard

Being inspired by the success of \texttt{word2vec} \citep{mikolov2013distributed} in capturing analogies, we study the conjecture that analogical relations can be represented by vector spaces. Unlike many previous works that focus on the…

Computation and Language · Computer Science 2020-10-27 Falcon Z. Dai

Embeddings are a fundamental component of many modern machine learning and natural language processing models. Understanding them and visualizing them is essential for gathering insights about the information they capture and the behavior…

Computation and Language · Computer Science 2019-05-30 Piero Molino , Yang Wang , Jiawei Zhang

We present a novel technique for learning semantic representations, which extends the distributional hypothesis to multilingual data and joint-space embeddings. Our models leverage parallel data and learn to strongly align the embeddings of…

Computation and Language · Computer Science 2014-04-21 Karl Moritz Hermann , Phil Blunsom

We introduce the algebraic entropy for continuous endomorphisms of locally linearly compact vector spaces over a discrete field, as the natural extension of the algebraic entropy for endomorphisms of discrete vector spaces. We show that the…

Dynamical Systems · Mathematics 2021-01-05 Ilaria Castellano , Anna Giordano Bruno

A new family of categorial grammars is proposed, defined by enriching basic categorial grammars with a conjunction operation. It is proved that the formalism obtained in this way has the same expressive power as conjunctive grammars, that…

Logic in Computer Science · Computer Science 2024-05-28 Stepan L. Kuznetsov , Alexander Okhotin