Measuring context-meaning for open class words in Hindi language

Word sense disambiguation (WSD), the task of identifying the intended sense of words has been a growing research area in the field of natural language processing. In this paper, the authors focused on word sense disambiguation for Hindi language using graph connectivity measures and Hindi WordNet[1]. To construct the graph for the sentence each sense of the ambiguous word is taken as a source node and all the paths which connects the sense to other words present in the sentence are added. The importance of nodes in the constructed graph are identified using node neighbor based measures (various centrality) and graph clustering based measures (denseness, graph randomness, edge density). The proposed method disambiguates all open class words (noun, verb, adjective, adverb) and disambiguates all the words present in the sentence simultaneously.

[1]  Rada Mihalcea,et al.  Unsupervised Graph-basedWord Sense Disambiguation Using Measures of Word Semantic Similarity , 2007, International Conference on Semantic Computing (ICSC 2007).

[2]  Rajeev Sangal,et al.  All Words Unsupervised Semantic Category Labeling for Hindi , 2009, RANLP.

[3]  Karsten P. Ulland,et al.  Vii. References , 2022 .

[4]  Hwee Tou Ng,et al.  Word Sense Disambiguation Improves Statistical Machine Translation , 2007, ACL.

[5]  A. M. Turing,et al.  Computing Machinery and Intelligence , 1950, The Philosophy of Artificial Intelligence.

[6]  Parul Rastogi,et al.  Performance comparison of Word Sense Disambiguation (WSD) Algorithm on Hindi Language Supporting Search Engines , 2011 .

[7]  David Yarowsky,et al.  Combining Classifiers for word sense disambiguation , 2002, Nat. Lang. Eng..

[8]  Parteek Bhatia,et al.  Word Sense Disambiguation for Hindi Language , 2008 .

[9]  A. M. Turing,et al.  Computing Machinery and Intelligence , 1950, The Philosophy of Artificial Intelligence.

[10]  Avneet Kaur.  Development of an Approach for Disambiguating Ambiguous Hindi postposition , 2010 .

[11]  Pushpak Bhattacharyya,et al.  A Graph Based Approach to Word Sense Disambiguation for Hindi Language , 2012 .

[12]  Satyendr Singh,et al.  Evaluating effect of context window size, stemming and stop word removal on Hindi word sense disambiguation , 2012, 2012 International Conference on Information Retrieval & Knowledge Management.

[13]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[14]  Mirella Lapata,et al.  An Experimental Study of Graph Connectivity for Unsupervised Word Sense Disambiguation , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  Tanveer J. Siddiqui,et al.  An Unsupervised Approach to Hindi Word Sense Disambiguation , 2009, IHCI.

[16]  Roberto Navigli,et al.  Word sense disambiguation: A survey , 2009, CSUR.

[17]  Pushpak Bhattacharyya,et al.  Hindi Word Sense Disambiguation , 2004 .

[18]  Rada Mihalcea,et al.  PageRank on Semantic Networks, with Application to Word Sense Disambiguation , 2004, COLING.

[19]  Rada Mihalcea,et al.  Unsupervised graph-based word sense disambiguation , 2009 .