Search Swinburne Research Bank
This object has not yet been indexed by the background indexing service.
Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.3/193527
|Download PDF (Published version) (Adobe Acrobat PDF, -1 bytes)|
- Building instance knowledge network for word sense disambiguation
- Hu, Shangfeng; Liu, Chengfei; Zhao, Xiaohui; Kowalkiewicz, Marek
- In this paper, a new high precision focused WSD approach is proposed, which not only attempts to identify the proper sense for a word but also provides the probabilistic evaluation for the identification confidence at the same time. A novel Instance Knowledge Network (IKN) is built to generate and maintain semantic knowledge at the word, type synonym set and instance levels. Related algorithms based on graph matching are developed to train IKN with probabilistic knowledge and to use IKN for probabilistic word sense disambiguation. Based on the Senseval-3 all-words task, we run extensive experiments to show the performance enhancements in different precision ranges and the rationality of probabilistic based automatic confidence evaluation of disambiguation. We combine our WSD algorithm with five best WSD algorithms in senseval-3 all words tasks. The results show that the combined algorithms all outperform the corresponding algorithms.
- Publication type
- Conference paper
- Research centre
- Swinburne University of Technology. Faculty of Information and Communication Technologies
- Conferences in research and practice in information technology: Proceedings of the 34th Australasian Computer Science Conference (ACSC 2011), Perth, Western Australia, Australia, 18-20 January 2011 / Mark Reynold (ed.), Vol. 113, pp. 3-10
- Publication year
- Australian Computer Society
- Publisher URL
- Copyright © 2011, Australian Computer Society, Inc. This paper appeared at the 34th Australasian Computer Science Conference (ACSC 2011), Perth, Australia. Conferences in Research and Practice in Information Technology (CRPIT), Vol. 113. M. Reynolds, Ed. Reproduction for academic, not-for profit purposes permitted provided this text is included. The published version of the paper is reproduced here in accordance with this policy.