Learning to Ignore: Long Document Coreference with Bounded Memory Neural Networks

Shubham Toshniwal, Sam Wiseman, Allyson Ettinger, Karen Livescu, Kevin Gimpel
10/6/2020
cs.CLcs.LG

Official code: shtoshni/long-doc-coref (26 stars, last commit 2021-07-03).

Abstract

Long document coreference resolution remains a challenging task due to the large memory and runtime requirements of current models. Recent work doing incremental coreference resolution using just the global representation of entities shows practical benefits but requires keeping all entities in memory, which can be impractical for long documents. We argue that keeping all entities in memory is unnecessary, and we propose a memory-augmented neural network that tracks only a small bounded number of entities at a time, thus guaranteeing a linear runtime in length of document. We show that (a) the model remains competitive with models with high memory and computational requirements on OntoNotes and LitBank, and (b) the model learns an efficient memory management strategy easily outperforming a rule-based strategy.

View on arXivView PDF

Code Implementations(1)

Code for the EMNLP 2020 paper "Learning to Ignore: Long Document Coreference with Bounded Memory Neural Networks"

264Python, Jupyter NotebookOct 5, 20205 years ago

Cite this paper

@article{toshniwal2020learning,
  title  = {Learning to Ignore: Long Document Coreference with Bounded Memory Neural Networks},
  author = {Shubham Toshniwal and Sam Wiseman and Allyson Ettinger and Karen Livescu and Kevin Gimpel},
  year   = {2020},
  eprint = {2010.02807},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2010.02807}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2010.02807.svg)](https://codeofpaper.com/paper/2010.02807)

Discussion