Dual Cache for Long Document Neural Coreference Resolution

2Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

Recent works show the effectiveness of cache-based neural coreference resolution models on long documents. These models incrementally process a long document from left to right and extract relations between mentions and entities in a cache, resulting in much lower memory and computation cost compared to computing all mentions in parallel. However, they do not handle cache misses when high-quality entities are purged from the cache, which causes wrong assignments and leads to prediction errors. We propose a new hybrid cache that integrates two eviction policies to capture global and local entities separately, and effectively reduces the aggregated cache misses up to half as before, while improving F1 score of coreference by 0.7 ∼ 5.7pt. As such, the hybrid policy can accelerate existing cache-based models and offer a new long document coreference resolution solution. Results show that our method outperforms existing methods on four benchmarks while saving up to 83% of inference time against non-cache-based models. Further, we achieve a new state-of-the-art on a long document coreference benchmark, LitBank.

Cite

CITATION STYLE

APA

Guo, Q., Hu, X., Zhang, Y., Qiu, X., & Zhang, Z. (2023). Dual Cache for Long Document Neural Coreference Resolution. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (Vol. 1, pp. 15272–15285). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2023.acl-long.851

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