Exploring Lexicalized Features for Coreference Resolution
(2011) The 15th Conference on Computational Natural Language Learning (CoNLL-2011): Shared Task p.45-50- Abstract
- 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... (More) - 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. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/2972016
- author
- Björkelund, Anders LU and Nugues, Pierre LU
- organization
- publishing date
- 2011
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- CoNLL 2011 - 15th Conference on Computational Natural Language Learning: Shared Task, Proceedings
- pages
- 45 - 50
- conference name
- The 15th Conference on Computational Natural Language Learning (CoNLL-2011): Shared Task
- conference dates
- 2011-06-23 - 2011-06-24
- external identifiers
-
- scopus:85123309064
- ISBN
- 9781937284084
- language
- English
- LU publication?
- yes
- id
- 4bbfa11d-e166-47c2-b1a2-0d3946e2e2c6 (old id 2972016)
- date added to LUP
- 2016-04-04 13:30:30
- date last changed
- 2022-05-15 02:45:01
@inproceedings{4bbfa11d-e166-47c2-b1a2-0d3946e2e2c6, abstract = {{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.<br/><br> <br/><br> 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.}}, author = {{Björkelund, Anders and Nugues, Pierre}}, booktitle = {{CoNLL 2011 - 15th Conference on Computational Natural Language Learning: Shared Task, Proceedings}}, isbn = {{9781937284084}}, language = {{eng}}, pages = {{45--50}}, title = {{Exploring Lexicalized Features for Coreference Resolution}}, url = {{https://lup.lub.lu.se/search/files/6137110/2972017.pdf}}, year = {{2011}}, }