Efficient Seq2seq Coreference Resolution Using Entity Representations
Matt Grenander, Shay B. Cohen, Mark Steedman
TL;DR
This work tackles incremental coreference resolution with seq2seq methods by introducing an Entity-Centric compressed representation that retains only entity-related tokens and a short contextual window. By reorganizing and memory-mapping entity mentions, the approach dramatically reduces input size and memory usage while delivering near state-of-the-art performance on OntoNotes and achieving SOTA results on LitBank. Key findings show the method is feasible for incremental processing with a compression ratio around 1.8x and substantial memory savings, albeit with some recall trade-offs in challenging categories like named entities and definite noun phrases. The results demonstrate that token-level compression focused on entities can preserve coreference signals and offer practical benefits for real-time or dialogue-style applications. The work also analyzes error sources, augmentation strategies, and the role of dataset annotations (e.g., singleton handling) in incremental settings, outlining clear avenues for further improvement.
Abstract
Seq2seq coreference models have introduced a new paradigm for coreference resolution by learning to generate text corresponding to coreference labels, without requiring task-specific parameters. While these models achieve new state-of-the-art performance, they do so at the cost of flexibility and efficiency. In particular, they do not efficiently handle incremental settings such as dialogue, where text must processed sequentially. We propose a compressed representation in order to improve the efficiency of these methods in incremental settings. Our method works by extracting and re-organizing entity-level tokens, and discarding the majority of other input tokens. On OntoNotes, our best model achieves just 0.6 CoNLL F1 points below a full-prefix, incremental baseline while achieving a compression ratio of 1.8. On LitBank, where singleton mentions are annotated, it passes state-of-the-art performance. Our results indicate that discarding a wide portion of tokens in seq2seq resolvers is a feasible strategy for incremental coreference resolution.
