English
Related papers

Related papers: Solving Hard Coreference Problems

200 papers

Recent coreference resolution models rely heavily on span representations to find coreference links between word spans. As the number of spans is $O(n^2)$ in the length of text and the number of potential links is $O(n^4)$, various pruning…

Computation and Language · Computer Science 2022-04-12 Vladimir Dobrovolskii

Commonsense reasoning is a long-standing challenge for deep learning. For example, it is difficult to use neural networks to tackle the Winograd Schema dataset (Levesque et al., 2011). In this paper, we present a simple method for…

Artificial Intelligence · Computer Science 2019-09-30 Trieu H. Trinh , Quoc V. Le

We introduce PreCo, a large-scale English dataset for coreference resolution. The dataset is designed to embody the core challenges in coreference, such as entity representation, by alleviating the challenge of low overlap between training…

Computation and Language · Computer Science 2018-10-24 Hong Chen , Zhenhua Fan , Hao Lu , Alan L. Yuille , Shu Rong

Document-level relation extraction is to extract relation facts from a document consisting of multiple sentences, in which pronoun crossed sentences are a ubiquitous phenomenon against a single sentence. However, most of the previous works…

Computation and Language · Computer Science 2022-02-23 Zhongxuan Xue , Rongzhen Li , Qizhu Dai , Zhong Jiang

In this paper, we present an accurate and extensible approach for the coreference resolution task. We formulate the problem as a span prediction task, like in machine reading comprehension (MRC): A query is generated for each candidate…

Computation and Language · Computer Science 2020-07-21 Wei Wu , Fei Wang , Arianna Yuan , Fei Wu , Jiwei Li

The state-of-the-art models for coreference resolution are based on independent mention pair-wise decisions. We propose a modelling approach that learns coreference at the document-level and takes global decisions. For this purpose, we…

Computation and Language · Computer Science 2022-04-01 Lesly Miculicich , James Henderson

The introduction of pretrained language models has reduced many complex task-specific NLP models to simple lightweight layers. An exception to this trend is coreference resolution, where a sophisticated task-specific model is appended to a…

Computation and Language · Computer Science 2021-06-01 Yuval Kirstain , Ori Ram , Omer Levy

Grounding a pronoun to a visual object it refers to requires complex reasoning from various information sources, especially in conversational scenarios. For example, when people in a conversation talk about something all speakers can see,…

Computation and Language · Computer Science 2019-09-04 Xintong Yu , Hongming Zhang , Yangqiu Song , Yan Song , Changshui Zhang

A coreference resolution system is to cluster all mentions that refer to the same entity in a given context. All coreference resolution systems need to tackle two main tasks: one task is to detect all of the potential mentions, and the…

Computation and Language · Computer Science 2022-12-21 Yu Wang , Hongxia Jin

Lexical features are a major source of information in state-of-the-art coreference resolvers. Lexical features implicitly model some of the linguistic phenomena at a fine granularity level. They are especially useful for representing the…

Computation and Language · Computer Science 2017-04-25 Nafise Sadat Moosavi , Michael Strube

Selectional preferences have long been claimed to be essential for coreference resolution. However, they are mainly modeled only implicitly by current coreference resolvers. We propose a dependency-based embedding model of selectional…

Computation and Language · Computer Science 2017-07-21 Benjamin Heinzerling , Nafise Sadat Moosavi , Michael Strube

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

The Winograd Schema Challenge is both a commonsense reasoning and natural language understanding challenge, introduced as an alternative to the Turing test. A Winograd schema is a pair of sentences differing in one or two words with a…

Computation and Language · Computer Science 2020-04-30 Vid Kocijan , Thomas Lukasiewicz , Ernest Davis , Gary Marcus , Leora Morgenstern

The target of a coreference resolution system is to cluster all mentions that refer to the same entity in a given context. All coreference resolution systems need to solve two subtasks; one task is to detect all of the potential mentions,…

Computation and Language · Computer Science 2022-12-20 Yu Wang , Hongxia Jin

The Winograd Schema Challenge (WSC) (Levesque, Davis, and Morgenstern 2011), a benchmark for commonsense reasoning, is a set of 273 expert-crafted pronoun resolution problems originally designed to be unsolvable for statistical models that…

Computation and Language · Computer Science 2019-11-25 Keisuke Sakaguchi , Ronan Le Bras , Chandra Bhagavatula , Yejin Choi

Unresolved coreference is a bottleneck for relation extraction, and high-quality coreference resolvers may produce an output that makes it a lot easier to extract knowledge triples. We show how to improve coreference resolvers by forwarding…

Large autoregressive generative models have emerged as the cornerstone for achieving the highest performance across several Natural Language Processing tasks. However, the urge to attain superior results has, at times, led to the premature…

Computation and Language · Computer Science 2024-08-01 Giuliano Martinelli , Edoardo Barba , Roberto Navigli

Pronoun resolution is part of coreference resolution, the task of pairing an expression to its referring entity. This is an important task for natural language understanding and a necessary component of machine translation systems, chat…

Computation and Language · Computer Science 2019-06-14 Matei Ionita , Yury Kashnitsky , Ken Krige , Vladimir Larin , Denis Logvinenko , Atanas Atanasov

Coreference resolution is essential for natural language understanding and has been long studied in NLP. In recent years, as the format of Question Answering (QA) became a standard for machine reading comprehension (MRC), there have been…

Computation and Language · Computer Science 2021-06-10 Mingzhu Wu , Nafise Sadat Moosavi , Dan Roth , Iryna Gurevych

We propose a coreference annotation scheme as a layer on top of the Universal Conceptual Cognitive Annotation foundational layer, treating units in predicate-argument structure as a basis for entity and event mentions. We argue that this…

Computation and Language · Computer Science 2019-06-12 Jakob Prange , Nathan Schneider , Omri Abend