Paper: A Constrained Latent Variable Model for Coreference Resolution

ACL ID D13-1057
Title A Constrained Latent Variable Model for Coreference Resolution
Venue Conference on Empirical Methods in Natural Language Processing
Session Main Conference
Year 2013
Authors

Coreference resolution is a well known clus- tering task in Natural Language Processing. In this paper, we describe the Latent Left Linking model (L3M), a novel, principled, and linguis- tically motivated latent structured prediction approach to coreference resolution. We show that L3M 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 L3M and its constrained ver- sion, CL3M, are more accurate than several state-of-the-art approaches as well as some structured prediction models proposed in the literature.