A Simple Unsupervised Approach for Coreference Resolution using Rule-based Weak Supervision

3Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.

Abstract

Labeled data for the task of Coreference Resolution is a scarce resource, requiring significant human effort. While state-of-the-art coreference models rely on such data, we propose an approach that leverages an end-to-end neural model in settings where labeled data is unavailable. Specifically, using weak supervision, we transfer the linguistic knowledge encoded by Stanford’s rule-based coreference system to the end-to-end model, which jointly learns rich, contextualized span representations and coreference chains. Our experiments on the English OntoNotes corpus demonstrate that our approach effectively benefits from the noisy coreference supervision, producing an improvement over Stanford’s rule-based system (+3.7 F1) and outperforming the previous best unsupervised model (+0.9 F1). Additionally, we validate the efficacy of our method on two other datasets: PreCo and Litbank (+2.5 and +5 F1 on Stanford’s system, respectively).

Cite

CITATION STYLE

APA

Stolfo, A., Tanner, C., Gupta, V., & Sachan, M. (2022). A Simple Unsupervised Approach for Coreference Resolution using Rule-based Weak Supervision. In *SEM 2022 - 11th Joint Conference on Lexical and Computational Semantics, Proceedings of the Conference (pp. 79–88). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2022.starsem-1.7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free