earticle

논문검색

Unsupervised Word Sense Disambiguation Using Collocation and Measures of Graph Connectivity

초록

영어

Word Sense Disambiguation has been selected as research objectives in natural language processing for a long time, and it is a necessary task used to identify word senses in context. This paper explains the unsupervised graph-based WSD approach and suggests a new WSD approach using collocation and measures of graph connectivity. This approach uses collocation to find the accurate word sense in context, and searches words sense by measuring graph connectivity when the word can’t be found with collocation. The performance evaluation on the standard data set indicates that it has enhanced accuracy compared to the many existing graph-based algorithms.

목차

Abstract
 1. Introduction
 2. Related Research
 3. New Criteria of WSD
  3.1. WSD Using Collocation
  3.2. New WSD Algorithm
 4. Experiment and Results
 5. Conclusions
 References

저자정보

  • Jung Gil Cho Division of Computer Engineering, SungKyul University, SungKyul University ro, Manan gu, Anyang si, Gyeonggi do, Republic of Korea

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.