English
Related papers

Related papers: Scoring Coreference Chains with Split-Antecedent A…

200 papers

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 present an effective system adapted from the end-to-end neural coreference resolution model, targeting on the task of anaphora resolution in dialogues. Three aspects are specifically addressed in our approach, including the support of…

Computation and Language · Computer Science 2021-09-24 Liyan Xu , Jinho D. Choi

Now that the performance of coreference resolvers on the simpler forms of anaphoric reference has greatly improved, more attention is devoted to more complex aspects of anaphora. One limitation of virtually all coreference resolution models…

Computation and Language · Computer Science 2020-11-03 Juntao Yu , Nafise Sadat Moosavi , Silviu Paun , Massimo Poesio

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

Entity resolution aims at resolving repeated references to an entity in a document and forms a core component of natural language processing (NLP) research. This field possesses immense potential to improve the performance of other NLP…

Computation and Language · Computer Science 2018-05-31 Rhea Sukthanker , Soujanya Poria , Erik Cambria , Ramkumar Thirunavukarasu

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

The interpretation of anaphors depends on their antecedents as the semantic value that an anaphor eventually conveys is co-specified by the value of its antecedent. Interestingly, when occurring in a given syntactic position, different…

Computation and Language · Computer Science 2021-03-15 António Branco

We present a new architecture for storing and accessing entity mentions during online text processing. While reading the text, entity references are identified, and may be stored by either updating or overwriting a cell in a fixed-length…

Computation and Language · Computer Science 2019-07-10 Fei Liu , Luke Zettlemoyer , Jacob Eisenstein

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 and ellipses are two common phenomena in dialogues. Without resolving referring expressions and information omission, dialogue systems may fail to generate consistent and coherent responses. Traditionally, anaphora is resolved by…

Artificial Intelligence · Computer Science 2021-05-21 Bo-Hsiang Tseng , Shruti Bhargava , Jiarui Lu , Joel Ruben Antony Moniz , Dhivya Piraviperumal , Lin Li , Hong Yu

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

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

This paper presents an analysis of temporal anaphora in sentences which contain quantification over events, within the framework of Discourse Representation Theory. The analysis in (Partee 1984) of quantified sentences, introduced by a…

cmp-lg · Computer Science 2019-08-14 Rani Nelken , Nissim Francez

We propose a system for the interpretation of anaphoric relationships between unbound pronouns and quantifiers. The main technical contribution of our proposal consists in combining generalized quantifiers with dependent types. Empirically,…

Logic · Mathematics 2016-08-02 Justyna Grudzinska , Marek Zawadowski

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

Current work on automatic coreference resolution has focused on the OntoNotes benchmark dataset, due to both its size and consistency. However many aspects of the OntoNotes annotation scheme are not well understood by NLP practitioners,…

Computation and Language · Computer Science 2021-12-21 Amir Zeldes

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

Document-level relation extraction (DocRE) involves identifying relations between entities distributed in multiple sentences within a document. Existing methods focus on building a heterogeneous document graph to model the internal…

Computation and Language · Computer Science 2023-10-31 Chonggang Lu , Richong Zhang , Kai Sun , Jaein Kim , Cunwang Zhang , Yongyi Mao

Bridging refers to the associative relationship between inferable entities in a discourse and the antecedents which allow us to understand them, such as understanding what "the door" means with respect to an aforementioned "house". As…

Computation and Language · Computer Science 2025-06-10 Lauren Levine , Amir Zeldes

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
‹ Prev 1 2 3 10 Next ›