English
Related papers

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

200 papers

We apply BERT to coreference resolution, achieving strong improvements on the OntoNotes (+3.9 F1) and GAP (+11.5 F1) benchmarks. A qualitative analysis of model predictions indicates that, compared to ELMo and BERT-base, BERT-large is…

Computation and Language · Computer Science 2019-12-24 Mandar Joshi , Omer Levy , Daniel S. Weld , Luke Zettlemoyer

We propose a multi task learning-based neural model for resolving bridging references tackling two key challenges. The first challenge is the lack of large corpora annotated with bridging references. To address this, we use multi-task…

Computation and Language · Computer Science 2020-11-03 Juntao Yu , Massimo Poesio

Neural abstractive summarization has been widely studied and achieved great success with large-scale corpora. However, the considerable cost of annotating data motivates the need for learning strategies under low-resource settings. In this…

Computation and Language · Computer Science 2023-03-27 Yi-Syuan Chen , Yun-Zhu Song , Hong-Han Shuai

Annotation noise is widespread in datasets, but manually revising a flawed corpus is time-consuming and error-prone. Hence, given the prior knowledge in Pre-trained Language Models and the expected uniformity across all annotations, we…

Computation and Language · Computer Science 2022-05-12 Chang Shu

We propose a sentence-incremental neural coreference resolution system which incrementally builds clusters after marking mention boundaries in a shift-reduce method. The system is aimed at bridging two recent approaches at coreference…

Computation and Language · Computer Science 2023-05-29 Matt Grenander , Shay B. Cohen , Mark Steedman

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

Comparing bridging annotations across coreference resources is difficult, largely due to a lack of standardization across definitions and annotation schemas and narrow coverage of disparate text domains across resources. To alleviate domain…

Computation and Language · Computer Science 2024-10-03 Lauren Levine , Amir Zeldes

This paper presents an algorithm for identifying noun-phrase antecedents of pronouns and adjectival anaphors in Spanish dialogues. We believe that anaphora resolution requires numerous sources of information in order to find the correct…

Computation and Language · Computer Science 2011-06-06 P. Martinez-Barco , M. Palomar

We present our 7th place solution to the Gendered Pronoun Resolution challenge, which uses BERT without fine-tuning and a novel augmentation strategy designed for contextual embedding token-level tasks. Our method anonymizes the referent by…

Computation and Language · Computer Science 2019-06-12 Bo Liu

Pretrained multilingual contextual representations have shown great success, but due to the limits of their pretraining data, their benefits do not apply equally to all language varieties. This presents a challenge for language varieties…

Computation and Language · Computer Science 2022-06-22 Ethan C. Chau , Lucy H. Lin , Noah A. Smith

Coreference resolution, critical for identifying textual entities referencing the same entity, faces challenges in pronoun resolution, particularly identifying pronoun antecedents. Existing methods often treat pronoun resolution as a…

Computation and Language · Computer Science 2024-05-20 Hassan Haji Mohammadi , Alireza Talebpour , Ahmad Mahmoudi Aznaveh , Samaneh Yazdani

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

We introduce a fully differentiable approximation to higher-order inference for coreference resolution. Our approach uses the antecedent distribution from a span-ranking architecture as an attention mechanism to iteratively refine span…

Computation and Language · Computer Science 2018-04-17 Kenton Lee , Luheng He , Luke Zettlemoyer

Post-training (via supervised fine-tuning) improves instruction-following, but often induces semantic mode collapse by biasing models toward low-entropy fine-tuning data at the expense of the high-entropy pretraining distribution.…

We present the results of a study of definite descriptions use in written texts aimed at assessing the feasibility of annotating corpora with information about definite description interpretation. We ran two experiments, in which subjects…

cmp-lg · Computer Science 2007-05-23 Massimo Poesio , Renata Vieira

This paper proposes a method to analyze Japanese anaphora, in which zero pronouns (omitted obligatory cases) are used to refer to preceding entities (antecedents). Unlike the case of general coreference resolution, zero pronouns have to be…

Computation and Language · Computer Science 2007-05-23 Kazuhiro Seki , Atsushi Fujii , Tetsuya Ishikawa

Multilingual coreference resolution (MCR) has been a long-standing and challenging task. With the newly proposed multilingual coreference dataset, CorefUD (Nedoluzhko et al., 2022), we conduct an investigation into the task by using its…

Computation and Language · Computer Science 2023-10-30 Haixia Chai , Michael Strube

Previous work on bridging anaphora recognition (Hou et al., 2013a) casts the problem as a subtask of learning fine-grained information status (IS). However, these systems heavily depend on many hand-crafted linguistic features. In this…

Computation and Language · Computer Science 2020-11-03 Yufang Hou

All state-of-the-art coreference resolution (CR) models involve finetuning a pretrained language model. Whether the superior performance of one CR model over another is due to the choice of language model or other factors, such as the…

Computation and Language · Computer Science 2024-04-24 Ian Porada , Xiyuan Zou , Jackie Chi Kit Cheung

Anaphora resolution is a challenging task which has been the interest of NLP researchers for a long time. Traditional resolution techniques like eliminative constraints and weighted preferences were successful in many languages. However,…

Computation and Language · Computer Science 2019-11-25 Vinay Annam , Nikhil Koditala , Radhika Mamidi