English
Related papers

Related papers: Paracompositionality, MWEs and Argument Substituti…

200 papers

The words-as-classifiers model of grounded lexical semantics learns a semantic fitness score between physical entities and the words that are used to denote those entities. In this paper, we explore how such a model can incrementally…

Computation and Language · Computer Science 2019-11-11 Daniele Moro , Stacy Black , Casey Kennington

Argumentation has proved a useful tool in defining formal semantics for assumption-based reasoning by viewing a proof as a process in which proponents and opponents attack each others arguments by undercuts (attack to an argument's premise)…

Logic in Computer Science · Computer Science 2007-05-23 Ralf Schweimeier , Michael Schroeder

A categorial grammar assigns one of several syntactic categories to each symbol of the alphabet, and the category of a string is then deduced from the categories assigned to its symbols using two simple reduction rules. This paper…

Logic · Mathematics 2025-05-21 Maxim Vishnikin , Alexander Okhotin

Multiword expressions (MWEs) refer to idiomatic sequences of multiple words. MWE identification, i.e., detecting MWEs in text, can play a key role in downstream tasks such as machine translation, but existing datasets for the task are…

Computation and Language · Computer Science 2025-07-11 Yusuke Ide , Joshua Tanner , Adam Nohejl , Jacob Hoffman , Justin Vasselli , Hidetaka Kamigaito , Taro Watanabe

In this dissertation we develop a new formal graphical framework for causal reasoning. Starting with a review of monoidal categories and their associated graphical languages, we then revisit probability theory from a categorical perspective…

Probability · Mathematics 2013-01-29 Brendan Fong

We obtain, for the first time, a modular many-valued semantics for combined logics, which is built directly from many-valued semantics for the logics being combined, by means of suitable universal operations over partial non-deterministic…

Logic · Mathematics 2024-05-22 Carlos Caleiro , Sérgio Marcelino

We show that contrary to common belief in the DisCoCat community, a monoidal category is all that is needed to define a categorical compositional model of natural language. This relies on a construction which freely adds adjoints to a…

Category Theory · Mathematics 2020-09-16 Antonin Delpeuch

Tableaux originate as a decision method for a logical language. They can also be extended to obtain a structure that spells out all the information in a set of sentences in terms of truth value assignments to atomic formulas that appear in…

cmp-lg · Computer Science 2008-02-03 Pablo Gervas

Languages vary widely in how meanings map to word forms. These mappings have been found to support efficient communication; however, this theory does not account for systematic relations within word forms. We examine how a restricted set of…

Computation and Language · Computer Science 2026-01-27 Doreen Osmelak , Yang Xu , Michael Hahn , Kate McCurdy

The project aims to provide a semi-supervised approach to identify Multiword Expressions in a multilingual context consisting of English and most of the major Indian languages. Multiword expressions are a group of words which refers to some…

Computation and Language · Computer Science 2016-12-02 Lahari Poddar

Theories of natural language and concepts have been unable to model the flexibility, creativity, context-dependence, and emergence, exhibited by words, concepts and their combinations. The mathematical formalism of quantum theory has…

Artificial Intelligence · Computer Science 2016-09-09 Diederik Aerts , Jan Broekaert , Liane Gabora , Sandro Sozzo

Diagrammatically speaking, grammatical calculi such as pregroups provide wires between words in order to elucidate their interactions, and this enables one to verify grammatical correctness of phrases and sentences. In this paper we also…

Computation and Language · Computer Science 2021-06-15 Bob Coecke , Vincent Wang

The interpretation of parasitic gaps is an ostensible case of non-linearity in natural language composition. Existing categorial analyses, both in the typelogical and in the combinatory traditions, rely on explicit forms of syntactic…

Computation and Language · Computer Science 2020-07-08 Michael Moortgat , Mehrnoosh Sadrzadeh , Gijs Wijnholds

Various concepts of grammatical compositionality arise in many theories of both natural and artificial languages, and often play a key role in accounts of the syntax-semantics interface. We propose that many instances of compositionality…

Computation and Language · Computer Science 2022-01-17 Norman E. Trushaev

Idioms are unlike most phrases in two important ways. First, the words in an idiom have non-canonical meanings. Second, the non-canonical meanings of words in an idiom are contingent on the presence of other words in the idiom. Linguistic…

Computation and Language · Computer Science 2022-09-16 Michaela Socolof , Jackie Chi Kit Cheung , Michael Wagner , Timothy J. O'Donnell

We propose a cognitively and linguistically motivated set of sorts for lexical semantics in a compositional setting: the classifiers in languages that do have such pronouns. These sorts are needed to include lexical considerations in a…

Computation and Language · Computer Science 2013-12-12 Bruno Mery , Christian Retoré

Distributional semantics provides multi-dimensional, graded, empirically induced word representations that successfully capture many aspects of meaning in natural languages, as shown in a large body of work in computational linguistics;…

Computation and Language · Computer Science 2020-03-19 Gemma Boleda

One of the key issues in both natural language understanding and generation is the appropriate processing of Multiword Expressions (MWEs). MWEs pose a huge problem to the precise language processing due to their idiosyncratic nature and…

Computation and Language · Computer Science 2014-01-24 Tanmoy Chakraborty , Dipankar Das , Sivaji Bandyopadhyay

Under categorial grammars that have powerful rules like composition, a simple n-word sentence can have exponentially many parses. Generating all parses is inefficient and obscures whatever true semantic ambiguities are in the input. This…

cmp-lg · Computer Science 2008-02-03 Jason Eisner

The study of Description Logics have been historically mostly focused on features that can be translated to decidable fragments of first-order logic. In this paper, we leave this restriction behind and look for useful and decidable…

Logic in Computer Science · Computer Science 2023-08-30 Joshua Hirschbrunn , Yevgeny Kazakov