English
Related papers

Related papers: Free the Plural: Unrestricted Split-Antecedent Ana…

200 papers

Resolving abstract anaphora is an important, but difficult task for text understanding. Yet, with recent advances in representation learning this task becomes a more tangible aim. A central property of abstract anaphora is that it…

Computation and Language · Computer Science 2017-07-24 Ana Marasović , Leo Born , Juri Opitz , Anette Frank

Anaphoric reference is an aspect of language interpretation covering a variety of types of interpretation beyond the simple case of identity reference to entities introduced via nominal expressions covered by the traditional coreference…

Computation and Language · Computer Science 2022-05-26 Silviu Paun , Juntao Yu , Nafise Sadat Moosavi , Massimo Poesio

The state-of-the-art on basic, single-antecedent anaphora has greatly improved in recent years. Researchers have therefore started to pay more attention to more complex cases of anaphora such as split-antecedent anaphora, as in Time-Warner…

Computation and Language · Computer Science 2021-04-13 Juntao Yu , Nafise Sadat Moosavi , Silviu Paun , Massimo Poesio

We introduce a new benchmark for coreference resolution and NLI, Knowref, that targets common-sense understanding and world knowledge. Previous coreference resolution tasks can largely be solved by exploiting the number and gender of the…

Computation and Language · Computer Science 2019-06-17 Ali Emami , Paul Trichelair , Adam Trischler , Kaheer Suleman , Hannes Schulz , Jackie Chi Kit Cheung

Coreference resolution is the task of finding expressions that refer to the same entity in a text. Coreference models are generally trained on monolingual annotated data but annotating coreference is expensive and challenging. Hardmeier et…

Computation and Language · Computer Science 2023-05-30 Gongbo Tang , Christian Hardmeier

Anaphora resolution is envisaged in this paper as part of the reference resolution process. A general open architecture is proposed, which can be particularized and configured in order to simulate some classic anaphora resolution methods.…

Computation and Language · Computer Science 2007-05-23 Andrei Popescu-Belis , Isabelle Robba

We introduce the first end-to-end coreference resolution model and show that it significantly outperforms all previous work without using a syntactic parser or hand-engineered mention detector. The key idea is to directly consider all spans…

Computation and Language · Computer Science 2017-12-19 Kenton Lee , Luheng He , Mike Lewis , Luke Zettlemoyer

Anaphora resolution (coreference) systems designed for the CONLL 2012 dataset typically cannot handle key aspects of the full anaphora resolution task such as the identification of singletons and of certain types of non-referring…

Computation and Language · Computer Science 2020-06-23 Juntao Yu , Alexandra Uma , Massimo Poesio

Traditional learning-based coreference resolvers operate by training the mention-pair model for determining whether two mentions are coreferent or not. Though conceptually simple and easy to understand, the mention-pair model is…

Computation and Language · Computer Science 2014-05-21 Altaf Rahman , Vincent Ng

We investigate modeling coreference resolution under a fixed memory constraint by extending an incremental clustering algorithm to utilize contextualized encoders and neural components. Given a new sentence, our end-to-end algorithm…

Computation and Language · Computer Science 2020-10-09 Patrick Xia , João Sedoc , Benjamin Van Durme

Since the first end-to-end neural coreference resolution model was introduced, many extensions to the model have been proposed, ranging from using higher-order inference to directly optimizing evaluation metrics using reinforcement…

Computation and Language · Computer Science 2022-02-10 Tuan Manh Lai , Trung Bui , Doo Soon Kim

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

Anaphoric expressions, such as pronouns and referential descriptions, are situated with respect to the linguistic context of prior turns, as well as, the immediate visual environment. However, a speaker's referential descriptions do not…

Computation and Language · Computer Science 2023-07-27 Javier Chiyah-Garcia , Alessandro Suglia , José Lopes , Arash Eshghi , Helen Hastie

We improve upon pairwise annotation for active learning in coreference resolution, by asking annotators to identify mention antecedents if a presented mention pair is deemed not coreferent. This simple modification, when combined with a…

Computation and Language · Computer Science 2020-05-20 Belinda Z. Li , Gabriel Stanovsky , Luke Zettlemoyer

Standard machine translation systems process sentences in isolation and hence ignore extra-sentential information, even though extended context can both prevent mistakes in ambiguous cases and improve translation coherence. We introduce a…

Computation and Language · Computer Science 2018-05-28 Elena Voita , Pavel Serdyukov , Rico Sennrich , Ivan Titov

We probe pre-trained transformer language models for bridging inference. We first investigate individual attention heads in BERT and observe that attention heads at higher layers prominently focus on bridging relations in-comparison with…

Computation and Language · Computer Science 2021-04-20 Onkar Pandit , Yufang Hou

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

Academic neural models for coreference resolution (coref) are typically trained on a single dataset, OntoNotes, and model improvements are benchmarked on that same dataset. However, real-world applications of coref depend on the annotation…

Computation and Language · Computer Science 2021-10-04 Patrick Xia , Benjamin Van Durme

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

We present SpanBERT, a pre-training method that is designed to better represent and predict spans of text. Our approach extends BERT by (1) masking contiguous random spans, rather than random tokens, and (2) training the span boundary…

Computation and Language · Computer Science 2020-01-22 Mandar Joshi , Danqi Chen , Yinhan Liu , Daniel S. Weld , Luke Zettlemoyer , Omer Levy
‹ Prev 1 2 3 10 Next ›