Graph-based Chinese word sense disambiguation with multi-knowledge integration
- Publication Type:
- Journal Article
- Citation:
- Computers, Materials and Continua, 2019, 61 (1), pp. 197 - 212
- Issue Date:
- 2019-01-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| Graph-Based Chinese Word Sense Disambiguation with Multi-Knowledge Integration.pdf | Published Version | 449.44 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
© 2019 Tech Science Press. All rights reserved. Word sense disambiguation (WSD) is a fundamental but significant task in natural language processing, which directly affects the performance of upper applications. However, WSD is very challenging due to the problem of knowledge bottleneck, i.e., it is hard to acquire abundant disambiguation knowledge, especially in Chinese. To solve this problem, this paper proposes a graph-based Chinese WSD method with multi-knowledge integration. Particularly, a graph model combining various Chinese and English knowledge resources by word sense mapping is designed. Firstly, the content words in a Chinese ambiguous sentence are extracted and mapped to English words with BabelNet. Then, English word similarity is computed based on English word embeddings and knowledge base. Chinese word similarity is evaluated with Chinese word embedding and HowNet, respectively. The weights of the three kinds of word similarity are optimized with simulated annealing algorithm so as to obtain their overall similarities, which are utilized to construct a disambiguation graph. The graph scoring algorithm evaluates the importance of each word sense node and judge the right senses of the ambiguous words. Extensive experimental results on SemEval dataset show that our proposed WSD method significantly outperforms the baselines.
Please use this identifier to cite or link to this item: