Search Swinburne Research Bank
Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.3/167126
|Download PDF (Accepted manuscript) (Adobe Acrobat PDF, 226 KB)|
- Incorporating coreference resolution into word sense disambiguation
- Hu, Shangfeng; Liu, Chengfei
- Word sense disambiguation (WSD) and coreference resolution are two fundamental tasks for natural language processing. Unfortunately, they are seldom studied together. In this paper, we propose to incorporate the coreference resolution technique into a word sense disambiguation system for improving disambiguation precision. Our work is based on the existing instance knowledge network (IKN) based approach for WSD. With the help of coreference resolution, we are able to connect related candidate dependency graphs at the candidate level and similarly the related instance graph patterns at the instance level in IKN together. Consequently, the contexts which can be considered for WSD are expanded and precision for WSD is improved. Based on Senseval-3 all-words task, we run extensive experiments by following the same experimental approach as the IKN based WSD. It turns out that each combined algorithm between the extended IKN WSD algorithm and one of the best five existing algorithms consistently outperforms the corresponding combined algorithm between the IKN WSD algorithm and the existing algorithm.
- Publication type
- Conference paper
- Research centre
- Swinburne University of Technology. Faculty of Information and Communication Technologies
- Lecture notes in computer science: Proceedings of the 12th International Conference on Computational Linguistics and Intelligent Text Processing (CICLing 2011), Tokyo, Japan, 20-26 February 2011 / Alexander Gelbukh (ed.), Vol. 6608, pp. 265-276
- Publication year
- FOR Code(s)
- 0801 Artificial Intelligence and Image Processing
- Coreference resolution; Natural language processing; Word sense disambiguation
- 0302-9743 (series ISSN)
- 9783642193996, 3642193994
- Publisher URL
- Copyright © Springer-Verlag Berlin Heidelberg 2011. The accepted manuscript is reproduced in accordance with the copyright policy of the publisher. The definitive version of the publication is available at www.springer.com.
- Additional information
- This paper was named the best student paper at the 12th International Conference on Intelligent Text Processing and Computational Linguistics.
- Full text
- Peer reviewed