Unsupervised hindi word sense disambiguation using graph based centrality measures
Open Access
- 1 December 2024
- journal article
- Published by Institute of Advanced Engineering and Science in IAES International Journal of Artificial Intelligence (IJ-AI)
- Vol. 13 (4) , 4957-4964
Abstract
The task of word sense disambiguation (WSD) plays a key role in multiple applications of natural language processing. In this paper, we propose a novel unsupervised method for targeted Hindi WSD task. First, we create a weighted graph where the nodes correspond to various synsets of the target word and the neighboring context words. The edges in the graph represent the semantic relations between these synsets in the Hindi WordNet hierarchy. A path-based similarity measure, namely Leacock-Chodorow similarity measure, is used to assign weights to edges. An unsupervised weighted graph-based centrality algorithm is used to identify the correct sense of a target word in a given context. The performance of the proposed algorithm is measured on 20 ambiguous Hindi nouns using four different graph-based centrality measures. We observed a maximum accuracy of 66.92% using PageRank centrality measure which is significantly better than earlier reported graph-based Hindi WSD algorithmsevaluated on the same dataset.Keywords
This publication has 23 references indexed in Scilit:
- A Novel Unsupervısed Graph-Based Algorıthm for Hindi Word Sense DisambiguationSN Computer Science, 2023
- Categorization of knowledge graph based recommendation methods and benchmark datasets from the perspectives of application scenarios: A comprehensive surveyExpert Systems with Applications, 2022
- Word Sense Disambiguation in Telugu Language Using Knowledge-Based Approach2020
- Measuring context-meaning for open class words in Hindi language2013
- Hindi Word Sense Disambiguation Using Semantic Relatedness Measure2013
- An Experimental Study on Unsupervised Graph-based Word Sense Disambiguation2010
- A structural approach to the automatic adjudication of word sense disagreementsNatural Language Engineering, 2008
- HyperLex: lexical cartography for information retrievalComputer Speech & Language, 2004
- Using Measures of Semantic Relatedness for Word Sense Disambiguation2003
- An Adapted Lesk Algorithm for Word Sense Disambiguation Using WordNet2002