Your browser has javascript turned off or blocked. This will lead to some parts of our website to not work properly or at all. Turn on javascript for best performance.

The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here:

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Physics lego figure. Photo.

Anders Björkelund


Physics lego figure. Photo.

Exploring Lexicalized Features for Coreference Resolution


  • Anders Björkelund
  • Pierre Nugues

Summary, in English

In this paper, we describe a coreference solver based on the extensive use of lexical features and features extracted from dependency graphs of the sentences. The solver uses Soon et al. (2001)'s classical resolution algorithm based on a pairwise classification of the mentions.

We applied this solver to the closed track of the CoNLL 2011 shared task (Pradhan et al., 2011). We carried out a systematic optimization of the feature set using cross-validation that led us to retain 24 features. Using this set, we reached a MUC score of 58.61 on the test set of the shared task. We analyzed the impact of the features on the development set and we show the importance of lexicalization as well as of properties related to dependency links in coreference resolution.


  • ELLIIT: the Linköping-Lund initiative on IT and mobile communication
  • Department of Computer Science
  • Robotics and Semantic Systems

Publishing year







[Host publication title missing]

Document type

Conference paper


  • Computer Science

Conference name

The 15th Conference on Computational Natural Language Learning (CoNLL-2011): Shared Task

Conference date

2011-06-23 - 2011-06-24




  • ISBN: 9781937284084