Skip to Main content Skip to Navigation
Conference papers

Joint Anaphoricity Detection and Coreference Resolution with Constrained Latent Structures

Emmanuel Lassalle 1 Pascal Denis 2
1 ALPAGE - Analyse Linguistique Profonde à Grande Echelle ; Large-scale deep linguistic processing
Inria Paris-Rocquencourt, UPD7 - Université Paris Diderot - Paris 7
2 MAGNET - Machine Learning in Information Networks
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189
Abstract : This paper introduces a new structured model for learning anaphoricity detection and coreference resolution in a joint fashion. Specifically, we use a latent tree to represent the full coreference and anaphoric structure of a document at a global level, and we jointly learn the parameters of the two models using a version of the structured perceptron algorithm. Our joint structured model is further refined by the use of pairwise constraints which help the model to capture accurately certain patterns of coreference. Our experiments on the CoNLL-2012 English datasets show large improvements in both coreference resolution and anaphoricity detection, compared to various competing architectures. Our best coreference system obtains a CoNLL score of 81:97 on gold mentions, which is to date the best score reported on this setting.
Complete list of metadata

Cited literature [37 references]  Display  Hide  Download
Contributor : Pascal Denis Connect in order to contact the contributor
Submitted on : Monday, September 28, 2015 - 2:04:51 PM
Last modification on : Friday, January 21, 2022 - 3:15:09 AM
Long-term archiving on: : Tuesday, December 29, 2015 - 10:15:20 AM


Files produced by the author(s)


  • HAL Id : hal-01205189, version 1


Emmanuel Lassalle, Pascal Denis. Joint Anaphoricity Detection and Coreference Resolution with Constrained Latent Structures. AAAI Conference on Artificial Intelligence (AAAI 2015), Jan 2015, Austin, Texas, United States. ⟨hal-01205189⟩



Les métriques sont temporairement indisponibles