Revisiting Memory-Efficient Incremental Coreference Resolution

04/30/2020
by   Patrick Xia, et al.
0

We explore the task of coreference resolution under fixed memory by extending an incremental clustering algorithm to utilize contextualized encoders and neural components. Our algorithm creates explicit representations for each entity, where given a new sentence, spans are proposed and subsequently scored against each entity representation, leading to emergent clusters. Our approach is end-to-end trainable and can be used to transform existing models, leading to an asymptotic reduction in memory usage while remaining competitive on task performance, which allows for more efficient use of computational resources for short documents, and making coreference more feasible across very long document contexts.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset