English
Related papers

Related papers: Anaphoric Binding: an integrated overview

200 papers

We present a hierarchy of natural language understanding abilities and argue for the importance of moving beyond assessments of understanding at the lexical and sentence levels to the discourse level. We propose the task of anaphora…

Computation and Language · Computer Science 2025-02-21 Xiaomeng Zhu , Zhenghao Zhou , Simon Charlow , Robert Frank

Measuring meaning is a central problem in cultural sociology and word embeddings may offer powerful new tools to do so. But like any tool, they build on and exert theoretical assumptions. In this paper I theorize the ways in which word…

Computation and Language · Computer Science 2021-07-23 Alina Arseniev-Koehler

Most current approaches to metaphor identification use restricted linguistic contexts, e.g. by considering only a verb's arguments or the sentence containing a phrase. Inspired by pragmatic accounts of metaphor, we argue that broader…

Computation and Language · Computer Science 2019-04-11 Jesse Mu , Helen Yannakoudakis , Ekaterina Shutova

We suggest a model for metaphor interpretation using word embeddings trained over a relatively large corpus. Our system handles nominal metaphors, like "time is money". It generates a ranked list of potential interpretations of given…

Computation and Language · Computer Science 2021-12-07 Kfir Bar , Nachum Dershowitz , Lena Dankin

Gender bias is highly impacting natural language processing applications. Word embeddings have clearly been proven both to keep and amplify gender biases that are present in current data sources. Recently, contextualized word embeddings…

Computation and Language · Computer Science 2019-04-19 Christine Basta , Marta R. Costa-jussà , Noe Casas

Given a specific discourse, which discourse properties trigger the use of metaphorical language, rather than using literal alternatives? For example, what drives people to say "grasp the meaning" rather than "understand the meaning" within…

Computation and Language · Computer Science 2022-05-24 Prisca Piccirilli , Sabine Schulte im Walde

Logically constrained term rewriting is a rewriting framework that supports built-in data structures such as integers and bit vectors. Recently, constrained terms play a key role in various analyses and applications of logically constrained…

Logic in Computer Science · Computer Science 2025-12-16 Kanta Takahata , Jonas Schöpf , Naoki Nishida , Takahito Aoto

Figurative language is a challenge for language models since its interpretation is based on the use of words in a way that deviates from their conventional order and meaning. Yet, humans can easily understand and interpret metaphors,…

Computation and Language · Computer Science 2023-06-16 Philipp Wicke

Pronoun disambiguation in understanding text and discourse often requires the application of both general pragmatic knowledge and context-specific information. In AI and linguistics research, this has mostly been studied in cases where the…

Computation and Language · Computer Science 2022-04-06 Ernest Davis

Recursive relational specifications are commonly used to describe the computational structure of formal systems. Recent research in proof theory has identified two features that facilitate direct, logic-based reasoning about such…

Logic in Computer Science · Computer Science 2010-09-24 Andrew Gacek , Dale Miller , Gopalan Nadathur

The study of semantic relationships has revealed a close connection between these relationships and the morphological characteristics of a language. Morphology, as a subfield of linguistics, investigates the internal structure and formation…

Computation and Language · Computer Science 2023-07-14 Mohamed Naamane

It is claimed that a variety of facts concerning ellipsis, event reference, and interclausal coherence can be explained by two features of the linguistic form in question: (1) whether the form leaves behind an empty constituent in the…

cmp-lg · Computer Science 2008-02-03 Andrew Kehler

Possibility theory offers a framework where both Lehmann's "preferential inference" and the more productive (but less cautious) "rational closure inference" can be represented. However, there are situations where the second inference does…

Artificial Intelligence · Computer Science 2013-02-18 Salem Benferhat , Didier Dubois , Henri Prade

We present a new method for characterizing the interpretive possibilities generated by elliptical constructions in natural language. Unlike previous analyses, which postulate ambiguity of interpretation or derivation in the full clause…

cmp-lg · Computer Science 2016-08-31 Mary Dalrymple , Stuart M. Shieber , Fernando C. N. Pereira

Referring expression comprehension aims to localize objects identified by natural language descriptions. This is a challenging task as it requires understanding of both visual and language domains. One nature is that each object can be…

Computer Vision and Pattern Recognition · Computer Science 2021-04-21 Yi-Wen Chen , Yi-Hsuan Tsai , Ming-Hsuan Yang

As a contribution to metaphor analysis, we introduce a statistical, data-based investigation with empirical analysis of long-standing conjectures and a first-ever empirical exploration of the systematic features of metaphors. Conversely,…

Computation and Language · Computer Science 2023-09-18 Marie Teich , Wilmer Leal , Juergen Jost

Word embeddings are powerful representations that form the foundation of many natural language processing architectures, both in English and in other languages. To gain further insight into word embeddings, we explore their stability (e.g.,…

Computation and Language · Computer Science 2021-09-13 Laura Burdick , Jonathan K. Kummerfeld , Rada Mihalcea

Previous work on bridging anaphora resolution (Poesio et al., 2004; Hou et al., 2013b) use syntactic preposition patterns to calculate word relatedness. However, such patterns only consider NPs' head nouns and hence do not fully capture the…

Computation and Language · Computer Science 2018-11-15 Yufang Hou

Despite extensive research both on the theoretical and practical fronts, formalising, reasoning about, and implementing languages with variable binding is still a daunting endeavour - repetitive boilerplate and the overly complicated…

Logic in Computer Science · Computer Science 2022-01-11 Marcelo Fiore , Dmitrij Szamozvancev

It has been reliably shown that the similarity of word embeddings obtained from popular neural models such as BERT approximates effectively a form of semantic similarity of the meaning of those words. It is therefore natural to wonder if…

Artificial Intelligence · Computer Science 2024-08-02 Mathieu d'Aquin , Emmanuel Nauer