Role of Karaka Relations in Hindi Word Sense Disambiguation

Role of Karaka Relations in Hindi Word Sense Disambiguation

Satyendr Singh (Department of Electronics and Communication, University of Allahabad, Allahabad, India) and Tanveer J. Siddiqui (Department of Electronics and Communication, University of Allahabad, Allahabad, India)
Copyright: © 2015 |Pages: 22
DOI: 10.4018/JITR.2015070102
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

Karakas are an important constituent of Hindi language. Karaka relations express syntactico-semantic or semantico-syntactic relationship between verbs and nouns or pronouns in a sentence. They capture certain level of semantics closer to thematic relations, but different from it. A vibhakti is assigned to each karaka, in Paninian grammar. This paper investigates the role of karaka relations in Hindi Word Sense Disambiguation (WSD) by utilizing vibhaktis. Two supervised WSD algorithms were used for disambiguation. The first algorithm is based on conditional probability of co-occurring words and the second algorithm is Naïve Bayes (NB) classifier. The first algorithm utilizes various heuristics for analyzing the role of karakas in Hindi WSD. The authors obtained an improvement of 14.86% in precision by utilizing content words, vibhaktis and phrases containing them in context vector over the context vector of content words after dropping vibhaktis. A gain of 6.91% in precision was observed by using content words and vibhaktis in context vector over the context vector of content words after dropping vibhaktis of similar context window size. The authors obtained maximum precision of 50.73% by extracting vibhaktis in a ±3 window using WSD algorithm based on conditional probability of co-occurring words. They obtained maximum precision of 56.56% by extracting vibhaktis in a ±4 window using NB classifier.
Article Preview

1. Introduction

All natural languages contain words bearing multiple meanings and Hindi is not an exception. For example, the Hindi noun ‘हार’ (haar) may mean defeat or necklace. Human beings can identify the correct sense of a word from the context it is used in, but for machines it is very difficult task. Computational identification of most appropriate sense of a word in a given context is called as Word Sense Disambiguation (WSD). It is one of the most challenging tasks in Natural Language Processing (NLP). WSD algorithms can be broadly categorized into dictionary-based and corpus-based. Dictionary-based approaches use machine readable dictionary, thesaurus or computational lexicon for performing disambiguation. WordNet is the most widely used computational lexicon in English WSD. Work on dictionary-based approaches includes (Lesk, 1986; Banerjee & Pederson, 2002; Patwardhan et al., 2003). Corpus-based approaches can be further categorized into: supervised and unsupervised approaches. Supervised approaches use sense tagged corpus and apply machine learning classifier for disambiguation. The work reported in (Gale et al., 1992; Ng & Lee, 1996; Pedersen, 2000; Lee et al., 2004) used semantically tagged corpus for disambiguation. Unsupervised approaches use raw corpus for disambiguation. The work reported in (Yarowsky, 1995; Resnik, 1997) used raw corpus for disambiguation.

For Hindi WSD, little published work is available including (Sinha et al., 2004; Khapra et al., 2008; Khapra et al., 2009; Singh & Siddiqui, 2012; Singh et al., 2013). Sinha et al. (2004) used Hindi WordNet to extract words in extended sense definitions (synset, glosses and example sentences) and semantic relations (hypernyms, glosses of hypernyms, example sentences of hypernyms, hyponyms, glosses of hypernyms, example sentences of hypernyms, meronyms, glosses of meronyms, example sentences of meronyms). Disambiguation was performed using contextual overlap of words in context of target polysemous word and words in extended sense definitions and semantic relations. Khapra et al. (2008) studied domain specific WSD in a trilingual setting of English, Hindi and Marathi. The dominant senses of words in specific domains were used for disambiguation. They evaluated in Tourism and Health domains and achieved an F1-Score of 65% for all the three languages. Khapra et al. (2009) projected WordNet and corpus parameters from a more resource fortunate language to a less resource fortunate language. Their WSD approach was centered on a novel synset based multilingual dictionary and the observation that distribution of senses remains more or less invariant across languages within a domain. WSD in their work took place in a multilingual setting involving Hindi, Marathi, Bengali and Tamil. Singh et al. (2013) adapted Leacock-Chodorow measure of semantic relatedness for Hindi WSD. Evaluation was done on 20 polysemous Hindi nouns and they achieved an overall average accuracy of 60.65% using Leacock-Chodorow measure. Singh and Siddiqui (2012) evaluated a Lesk-Like algorithm for Hindi WSD. They used direct overlap for measuring the similarity. They evaluated the effects of stemming, stop word removal and context window size on Hindi WSD and obtained maximum overall precision after applying stop word removal and stemming. They observed drop in performance in some cases due to stemming mainly because stemming reduces different vibhakti signs in the same root form thus loosing the discrimination between karakas. For example, ‘के’ (ke), ‘की’ (ki), ‘का’ (ka) and ‘को’ (ko) reduces to ‘क’ (k) after stemming. Frequency analysis of vibhaktis in their dataset reveals that there exist interesting variations in the use of vibhaktis among different senses of a word to express relationship between different parts of speech in a sentence. Some vibhakti signs were more frequent in one sense than others. For example, frequency of ‘का’ (ka), ‘की’ (ki), ‘के’ (ke) and ‘लिए’ (liye) in 30 instances of sense 1, 79 instances of sense 2 and 36 instances of sense 3 of Hindi noun ‘उत्तर’ (uttar) was 3, 1, 7, 2 and 9, 30, 8, 2 and 9, 2, 12, 2 respectively. In this paper, we attempt to utilize this variation to identify correct sense of a word.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 10: 4 Issues (2017)
Volume 9: 4 Issues (2016)
Volume 8: 4 Issues (2015)
Volume 7: 4 Issues (2014)
Volume 6: 4 Issues (2013)
Volume 5: 4 Issues (2012)
Volume 4: 4 Issues (2011)
Volume 3: 4 Issues (2010)
Volume 2: 4 Issues (2009)
Volume 1: 4 Issues (2008)
View Complete Journal Contents Listing