Decision Tree based Supervised Word Sense Disambiguation for Assamese

  • Sarmah J
  • Kr. S
N/ACitations
Citations of this article
17Readers
Mendeley users who have this article in their library.

Abstract

Word Sense Disambiguation (WSD) aims to disambiguate the words which have multiple sense in a context automatically. Sense denotes the meaning of a word and the words which have various meanings in a context are referred as ambiguous words. WSD is vital in many important Natural Language Processing tasks like MT, IR, TC, SP etc. This research paper attempts to propose a supervised Machine Learning approach-Decision Tree for Word Sense Disambiguation task in Assamese language. A Decision Tree is decision model flow-chart like tree structure where each internal node denotes a test, each branch represents result of a test and each leaf holds a sense label. J48 a Java implementation of C4.5 decision tree algorithm is taken for experimentation in our case. A few polysemous words with different real occurrences in Assamese text with manual sense annotation was collected as the training and test dataset. DT algorithm produces average F-measure of .611 when 10-fold crossvalidation evaluation was performed on 10 Assamese ambiguous words.

Cite

CITATION STYLE

APA

Sarmah, J., & Kr., S. (2016). Decision Tree based Supervised Word Sense Disambiguation for Assamese. International Journal of Computer Applications, 141(1), 42–48. https://doi.org/10.5120/ijca2016909488

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free