Sensedependency-Rank: A Word Sense Disambiguation Method Based On Random Walks And Dependency Trees

COMPUTATIONAL LINGUISTICS AND INTELLIGENT TEXT PROCESSING (CICLING 2017), PT I(2018)

引用 1|浏览24
暂无评分
摘要
Word Sense Disambiguation (WSD) is the field that seeks to determine the correct sense of a word in a given context. In this paper, we present a WSD method based on random walks over a dependency tree, whose nodes are word-senses from the WordNet. Besides, our method incorporates prior knowledge about the frequency of use of the word-senses. We observed that our results outperform several graph-based WSD methods in All-Word task of SensEval-2 and SensEval-3, including the baseline, where the nouns and verbs part-of-speech show the better improvement in their F-measure scores.
更多
查看译文
关键词
Word Sense Disambiguation, Dependency tree, Random walks
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要