English
Related papers

Related papers: Paracompositionality, MWEs and Argument Substituti…

200 papers

Memorization in language models is typically treated as a homogenous phenomenon, neglecting the specifics of the memorized data. We instead model memorization as the effect of a set of complex factors that describe each sample and relate it…

Emerging computational paradigms, such as probabilistic and hybrid programming, introduce new primitive operations that often need to be combined with classic programming constructs. However, it still remains a challenge to provide a…

Logic in Computer Science · Computer Science 2018-04-13 Fredrik Dahlqvist , Renato Neves

We argue for a compositional semantics grounded in a strongly typed ontology that reflects our commonsense view of the world and the way we talk about it. Assuming such a structure we show that the semantics of various natural language…

Artificial Intelligence · Computer Science 2007-05-23 Walid S. Saba

Discourse relations bind smaller linguistic units into coherent texts. However, automatically identifying discourse relations is difficult, because it requires understanding the semantics of the linked arguments. A more subtle challenge is…

Computation and Language · Computer Science 2014-11-26 Yangfeng Ji , Jacob Eisenstein

A range of studies have concluded that neural word prediction models can distinguish grammatical from ungrammatical sentences with high accuracy. However, these studies are based primarily on monolingual evidence from English. To…

Computation and Language · Computer Science 2020-05-22 Aaron Mueller , Garrett Nicolai , Panayiota Petrou-Zeniou , Natalia Talmina , Tal Linzen

Languages may encode similar meanings using different sentence structures. This makes it a challenge to provide a single set of formal rules that can derive meanings from sentences in many languages at once. To overcome the challenge, we…

Computation and Language · Computer Science 2024-03-05 Laurestine Bradford , Timothy John O'Donnell , Siva Reddy

We revisit Levin's theory about the correspondence of verb meaning and syntax and infer semantic classes from a large syntactic classification of more than 600 German verbs taking clausal and non-finite arguments. Grasping the meaning…

Computation and Language · Computer Science 2016-06-24 Judith Eckle-Kohler

Techniques in which words are represented as vectors have proved useful in many applications in computational linguistics, however there is currently no general semantic formalism for representing meaning in terms of vectors. We present a…

Computation and Language · Computer Science 2015-03-17 Daoud Clarke

Matching logic is a general formal framework for reasoning about a wide range of theories, with particular emphasis on programming language semantics. Notably, the intermediate language of the K semantics framework is an extension of…

Logic in Computer Science · Computer Science 2025-09-17 Ádám Kurucz , Péter Bereczky , Dániel Horpácsi

The purpose of this paper is to show that the dual notions of elements & distinctions are the basic analytical concepts needed to unpack and analyze morphisms, duality, and universal constructions in the Sets, the category of sets and…

Category Theory · Mathematics 2024-10-07 David Ellerman

We introduce the logical grammar emdebbing (LGE), a model inspired by pregroup grammars and categorial grammars to enable unsupervised inference of lexical categories and syntactic rules from a corpus of text. LGE produces comprehensible…

Computation and Language · Computer Science 2023-06-07 Sean Deyo , Veit Elser

Natural language relies on a finite lexicon to express an unbounded set of emerging ideas. One result of this tension is the formation of new compositions, such that existing linguistic units can be combined with emerging items into novel…

Computation and Language · Computer Science 2021-09-13 Lei Yu , Yang Xu

Comparative constructions play an important role in natural language inference. However, attempts to study semantic representations and logical inferences for comparatives from the computational perspective are not well developed, due to…

Computation and Language · Computer Science 2019-10-03 Izumi Haruta , Koji Mineshima , Daisuke Bekki

Current approaches in paraphrase generation and detection heavily rely on a single general similarity score, ignoring the intricate linguistic properties of language. This paper introduces two new tasks to address this shortcoming by…

Computation and Language · Computer Science 2024-07-17 Jan Philip Wahle , Bela Gipp , Terry Ruas

We present a dataset for evaluating the grammaticality of the predictions of a language model. We automatically construct a large number of minimally different pairs of English sentences, each consisting of a grammatical and an…

Computation and Language · Computer Science 2018-08-29 Rebecca Marvin , Tal Linzen

Traditional language models treat language as a finite state automaton on a probability space over words. This is a very strong assumption when modeling something inherently complex such as language. In this paper, we challenge this by…

Computation and Language · Computer Science 2016-04-04 Kushal Arora , Anand Rangarajan

We argue in this paper that many common adverbial phrases generally taken to signal a discourse relation between syntactically connected units within discourse structure, instead work anaphorically to contribute relational meaning, with…

Computation and Language · Computer Science 2007-05-23 Bonnie Webber , Matthew Stone , Aravind Joshi , Alistair Knott

In this paper, our goal is to investigate to what degree multilingual pretrained language models capture cross-linguistically valid abstract linguistic representations. We take the approach of developing curated synthetic data on a large…

Computation and Language · Computer Science 2024-12-02 Vivi Nastase , Chunyang Jiang , Giuseppe Samo , Paola Merlo

Translations between different nonmonotonic formalisms always have been an important topic in the field, in particular to understand the knowledge-representation capabilities those formalisms offer. We provide such an investigation in terms…

Artificial Intelligence · Computer Science 2014-01-17 Wolfgang Dvorak , Stefan Woltran

We prove a theorem stating that any semantics can be encoded as a compositional semantics, which means that, essentially, the standard definition of compositionality is formally vacuous. We then show that when compositional semantics is…

cmp-lg · Computer Science 2008-02-03 Wlodek Zadrozny