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
키워드
collocationunsupervised word sense disambiguationWSDdegree CentralityWordNetgraph connectivity
저자
Jung Gil Cho [ Division of Computer Engineering, SungKyul University, SungKyul University ro, Manan gu, Anyang si, Gyeonggi do, Republic of Korea ]
보안공학연구지원센터(IJSEIA) [Science & Engineering Research Support Center, Republic of Korea(IJSEIA)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Software Engineering and Its Applications
간기
월간
pISSN
1738-9984
수록기간
2008~2016
등재여부
SCOPUS
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Software Engineering and Its Applications Vol.9 No.5