Abstract
Natural language processing applications invariably perform word sense disambiguation as one of its processing steps. The accuracy of sense disambiguation depends upon an efficient algorithm as well as a reliable knowledge-base in the form of annotated corpus and/or dictionaries in machine readable form. Algorithms working on corpus for sense disambiguation are generally employed as supervised machine learning systems. But such systems need ample training on the corpus before being applied on the actual data set. This paper discusses an unsupervised approach of a graph-based technique that solely works on a machine-readable dictionary as the knowledge source. This approach can improve the bottleneck problem that persists in corpus-based word sense disambiguation. The method described here attempts to make the algorithm more intelligent by considering various WordNet semantic relations and auto-filtration of content words before graph generation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
