Improving pairwise coreference models through feature space hierarchy learning

This paper proposes a new method for significantly improving the performance of pairwise coreference models. Given a set of indicators, our method learns how to best separate types of mention pairs into equivalence classes for which we construct distinct classification models. In effect, our approach finds an optimal feature space (derived from a base feature set and indicator set) for discriminating coreferential mention pairs. Although our approach explores a very large space of possible feature spaces, it remains tractable by exploiting the structure of the hierarchies built from the indicators. Our experiments on the CoNLL-2012 Shared Task English datasets (gold mentions) indicate that our method is robust relative to different clustering strategies and evaluation metrics, showing large and consistent improvements over a single pairwise model using the same base features. Our best system obtains a competitive 67:2 of average F1 over MUC, B3 , and CEAF which, despite its simplicity, places it above the mean score of other systems on these datasets.

[1]  Vincent Ng,et al.  Narrowing the Modeling Gap: A Cluster-Ranking Approach to Coreference Resolution , 2014, J. Artif. Intell. Res..

[2]  Koby Crammer,et al.  Online Passive-Aggressive Algorithms , 2003, J. Mach. Learn. Res..

[3]  M. R E C A S E,et al.  BLANC: Implementing the Rand index for coreference evaluation , 2010, Natural Language Engineering.

[4]  Douglas E. Appelt,et al.  The (Non)Utility of Predicate-Argument Frequencies for Pronoun Interpretation , 2004, NAACL.

[5]  Michael Strube,et al.  End-to-End Coreference Resolution via Hypergraph Partitioning , 2010, COLING.

[6]  Mira Ariel Referring and accessibility , 1988, Journal of Linguistics.

[7]  Thomas S. Morton,et al.  Coreference for NLP Applications , 2000, ACL.

[8]  Dan Klein,et al.  Coreference Semantics from Web Features , 2012, ACL.

[9]  Hwee Tou Ng,et al.  A Machine Learning Approach to Coreference Resolution of Noun Phrases , 2001, CL.

[10]  Simone Paolo Ponzetto,et al.  Exploiting Semantic Role Labeling, WordNet and Wikipedia for Coreference Resolution , 2006, NAACL.

[11]  Breck Baldwin,et al.  Algorithms for Scoring Coreference Chains , 1998 .

[12]  Yannick Versley,et al.  Coreference Systems Based on Kernels Methods , 2008, COLING.

[13]  Massimo Poesio,et al.  Disambiguation and Filtering Methods in Using Web Knowledge for Coreference Resolution , 2011, FLAIRS.

[14]  J. Franklin,et al.  The elements of statistical learning: data mining, inference and prediction , 2005 .

[15]  Claire Gardent,et al.  Improving Machine Learning Approaches to Coreference Resolution , 2002, ACL.

[16]  Wendy G. Lehnert,et al.  Using Decision Trees for Coreference Resolution , 1995, IJCAI.

[17]  Pascal Denis,et al.  Specialized Models and Ranking for Coreference Resolution , 2008, EMNLP.

[18]  Jian Su,et al.  A Unified Event Coreference Resolution by Integrating Multiple Resolvers , 2011, IJCNLP.

[19]  Vincent Ng Supervised Ranking for Pronoun Resolution: Some Recent Improvements , 2005, AAAI.

[20]  Cristina Nicolae,et al.  BESTCUT: A Graph Algorithm for Coreference Resolution , 2006, EMNLP.

[21]  Lynette Hirschman,et al.  A Model-Theoretic Coreference Scoring Scheme , 1995, MUC.

[22]  Dan Roth,et al.  Understanding the Value of Features for Coreference Resolution , 2008, EMNLP.

[23]  Xiaoqiang Luo,et al.  On Coreference Resolution Performance Metrics , 2005, HLT.

[24]  Pascal Denis,et al.  Global joint models for coreference resolution and named entity classification , 2009, Proces. del Leng. Natural.

[25]  Yuchen Zhang,et al.  CoNLL-2012 Shared Task: Modeling Multilingual Unrestricted Coreference in OntoNotes , 2012, EMNLP-CoNLL Shared Task.