A Constrained Latent Variable Model for Coreference Resolution
Kai-Wei Chang, Rajhans Samdani, Dan Roth · 2013
Coreference resolution is a well known clustering task in Natural Language Processing.In this paper, we describe the Latent Left Linking model (L 3 M), a novel, principled, and linguistically motivated latent structured prediction approach to coreference resolution.We show that L 3 M admits efficient inference and can be augmented with knowledge-based constraints; we also present a fast stochastic gradient based learning.Experiments on ACE and Ontonotes data show that L 3 M and its constrained version, CL 3 M, are more accurate than several state-of-the-art approaches as well as some structured prediction models proposed in the literature.