A Novel Unsupervısed Graph-Based Algorıthm for Hindi Word Sense Disambiguation
SN Computer Science, Volume 4, Article 675 (2023)
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.
Approximation Schemes for Capacitated Network Routing
ACM-SIAM Symposium on Discrete Algorithms (SODA)
Abstract We present a polynomial-time approximation scheme…