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: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

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

Exploring Lexicalized Features for Coreference Resolution

Author

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.

Publishing year

2011

Language

English

Pages

45-50

Publication/Series

CoNLL 2011 - 15th Conference on Computational Natural Language Learning: Shared Task, Proceedings

Document type

Conference paper

Topic

  • Computer Science

Conference name

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

Conference date

2011-06-23 - 2011-06-24

Status

Published

ISBN/ISSN/Other

  • ISBN: 9781937284084