SN Computer Science, Volume 4, Article 675 (2023)
A Novel Unsupervısed Graph-Based Algorıthm for Hindi Word Sense Disambiguation
Word Sense disambiguation using a graph-based algorithm for Hindi language where the edge-weights are derived from WordNet-based semantic similarity and the most appropriate sense is assigned using a random walk-type algorithm.
Artificial Intelligence and Signal Processing (IEEE-AISP) (2023)
Comparative Analysis of Path-based Similarity Measures for Word Sense Disambiguation
Word Sense disambiguation using a graph-based algorithm for Hindi language where the edge-weights are derived from WordNet-based semantic similarity. We evaluate two path-based similarity measures (Leacock-Chodrow and Shortest Path) and observe that Leacock-Chodrow performs better.