English
Related papers

Related papers: Cooperation between Pronoun and Reference Resoluti…

200 papers

The task of identifying synonymous relations and objects, or synonym resolution, is critical for high-quality information extraction. This paper investigates synonym resolution in the context of unsupervised information extraction, where…

Computation and Language · Computer Science 2014-01-23 Alexander Pieter Yates , Oren Etzioni

Notional anaphors are pronouns which disagree with their antecedents' grammatical categories for notional reasons, such as plural to singular agreement in: 'the government ... they'. Since such cases are rare and conflict with evidence from…

Computation and Language · Computer Science 2018-04-23 Amir Zeldes

Although several datasets annotated for anaphoric reference/coreference exist, even the largest such datasets have limitations in terms of size, range of domains, coverage of anaphoric phenomena, and size of documents included. Yet, the…

Computation and Language · Computer Science 2022-10-12 Juntao Yu , Silviu Paun , Maris Camilleri , Paloma Carretero Garcia , Jon Chamberlain , Udo Kruschwitz , Massimo Poesio

An account of utterance interpretation in discourse needs to face the issue of how the discourse context controls the space of interacting preferences. Assuming a discourse processing architecture that distinguishes the grammar and…

cmp-lg · Computer Science 2008-02-03 Megumi Kameyama

We describe three models submitted for the CODI-CRAC 2022 shared task. To perform identity anaphora resolution, we test several combinations of the incremental clustering approach based on the Workspace Coreference System (WCS) with other…

Computation and Language · Computer Science 2023-01-06 Tatiana Anikina , Natalia Skachkova , Joseph Renner , Priyansh Trivedi

Most current models of word representations(e.g.,GloVe) have successfully captured fine-grained semantics. However, semantic similarity exhibited in these word embeddings is not suitable for resolving bridging anaphora, which requires the…

Computation and Language · Computer Science 2018-04-16 Yufang Hou

This paper suggests a direction of coreference resolution for online decoding on actively generated input such as dialogue, where the model accepts an utterance and its past context, then finds mentions in the current utterance as well as…

Computation and Language · Computer Science 2022-05-24 Liyan Xu , Jinho D. Choi

We provide a unified account of sentence-level and text-level anaphora within the framework of a dependency-based grammar model. Criteria for anaphora resolution within sentence boundaries rephrase major concepts from GB's binding theory,…

cmp-lg · Computer Science 2016-08-31 Michael Strube , Udo Hahn

The visual dialog task requires an AI agent to interact with humans in multi-round dialogs based on a visual environment. As a common linguistic phenomenon, pronouns are often used in dialogs to improve the communication efficiency. As a…

Computation and Language · Computer Science 2022-05-31 Xintong Yu , Hongming Zhang , Ruixin Hong , Yangqiu Song , Changshui Zhang

Coreference resolution aims to identify words and phrases which refer to same entity in a text, a core task in natural language processing. In this paper, we extend this task to resolving coreferences in long-form narrations of visual…

Computer Vision and Pattern Recognition · Computer Science 2023-03-20 Arushi Goel , Basura Fernando , Frank Keller , Hakan Bilen

Pronouns are a long-standing challenge in machine translation. We present a study of the performance of a range of rule-based, statistical and neural MT systems on pronoun translation based on an extensive manual evaluation using the…

Computation and Language · Computer Science 2018-08-31 Christian Hardmeier , Liane Guillou

In anaphora resolution for English, animacy identification can play an integral role in the application of agreement restrictions between pronouns and candidates, and as a result, can improve the accuracy of anaphora resolution systems. In…

Computation and Language · Computer Science 2011-10-12 R. J. Evans , C. Orasan

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

Anaphora resolution is an important task for information extraction across a range of languages, text genres, and domains, motivating the need for methods that do not require large annotated datasets. In-context learning has emerged as a…

Computation and Language · Computer Science 2022-11-15 Nghia T. Le , Fan Bai , Alan Ritter

We present Contextual Query Rewrite (CQR) a dataset for multi-domain task-oriented spoken dialogue systems that is an extension of the Stanford dialog corpus (Eric et al., 2017a). While previous approaches have addressed the issue of…

Computation and Language · Computer Science 2019-04-02 Michael Regan , Pushpendre Rastogi , Arpit Gupta , Lambert Mathias

In order to take steps towards establishing a methodology for evaluating Natural Language systems, we conducted a case study. We attempt to evaluate two different approaches to anaphoric processing in discourse by comparing the accuracy and…

cmp-lg · Computer Science 2008-02-03 Marilyn A. Walker

Recent shifts in the space of large language model (LLM) research have shown an increasing focus on novel architectures to compete with prototypical Transformer-based models that have long dominated this space. Linear recurrent models have…

Computation and Language · Computer Science 2025-07-24 Xinyu Wang , Linrui Ma , Jerry Huang , Peng Lu , Prasanna Parthasarathi , Xiao-Wen Chang , Boxing Chen , Yufei Cui

Pronoun resolution is a major area of natural language understanding. However, large-scale training sets are still scarce, since manually labelling data is costly. In this work, we introduce WikiCREM (Wikipedia CoREferences Masked) a…

Computation and Language · Computer Science 2019-10-15 Vid Kocijan , Oana-Maria Camburu , Ana-Maria Cretu , Yordan Yordanov , Phil Blunsom , Thomas Lukasiewicz

This work, shows how propositional resolution can be generalized to obtain a resolution proof system for constrained pseudo-propositional logic (CPPL), which is an extension resulted from inserting the natural numbers with few constraints…

Logic · Mathematics 2023-06-13 Ahmad-Saher Azizi-Sultan

Most previous studies on bridging anaphora resolution (Poesio et al., 2004; Hou et al., 2013b; Hou, 2018a) use the pairwise model to tackle the problem and assume that the gold mention information is given. In this paper, we cast bridging…

Computation and Language · Computer Science 2020-06-26 Yufang Hou