Graph Refinement for Coreference Resolution

Lesly Miculicich; James Henderson

ACL 2022findings19 citations

Graph Refinement for Coreference Resolution

Abstract

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 model coreference links in a graph structure where the nodes are tokens in the text, and the edges represent the relationship between them. Our model predicts the graph in a non-autoregressive manner, then iteratively refines it based on previous predictions, allowing global dependencies between decisions. The experimental results show improvements over various baselines, reinforcing the hypothesis that document-level information improves conference resolution.

BibTeX

@inproceedings{miculicich-henderson-2022-graph,
    title = "Graph Refinement for Coreference Resolution",
    author = "Miculicich, Lesly  and
      Henderson, James",
    editor = "Muresan, Smaranda  and
      Nakov, Preslav  and
      Villavicencio, Aline",
    booktitle = "Findings of the Association for Computational Linguistics: ACL 2022",
    month = may,
    year = "2022",
    address = "Dublin, Ireland",
    publisher = "Association for Computational Linguistics",
    url = "https://aclanthology.org/2022.findings-acl.215/",
    doi = "10.18653/v1/2022.findings-acl.215",
    pages = "2732--2742"
}