The solution to this issue impacts other computerrelated writing, such as discourse, improving relevance of search engines, anaphora resolution, coherence, and inference. Challenges and practical approaches with word sense. Performance analysis of recent word sense disambiguation techniques. These hubs are used as a representation of the senses induced by the system, the same way that clusters of examples are used to represent senses in clustering approaches to wsd purandare and pedersen, 2004. Unsupervised largevocabulary word sense disambiguation. Adjusting sense representations for word sense disambiguation. Classic monolingual wordsense disambiguation wikipedia.
Algorithm that aim to solve the problem focus on the quality of the disambiguation alone and require considerable computational time. Mining sense of the words will bring more information in vector space model representation by adding groups of words that have meaning together. Acronym and abbreviation sense resolution is considered a special case of word sense disambiguation wsd 9,10,11. Word sense disambiguation wsd, the process of automatically identifying the meaning of a polysemous word in a sentence, is a fundamental task in natural language processing nlp. If a system makes an assignment for every word, then precision and recall are the same, and can be called accuracy. Word sense disambiguation using an evolutionary approach. Unsupervised graphbasedword sense disambiguation using. Adapted weighted graph for word sense disambiguation. The 2009 annual conference of the north american chapter of the association for computational linguistics, 2836. Art in the performance in this domain, recent works in different indian. Using the wordnet hierarchy, we embed the construction of abney and light 1999 in the topic model and show that automatically learned domains improve wsd accuracy compared to alternative contexts. In computational linguistics, wordsense disambiguation wsd is an open problem concerned with identifying which sense of a word is used in a sentence. Word sense disambiguation algorithms and applications.
Malayalam word sense disambiguation using maximum entropy. Download it once and read it on your kindle device, pc, phones or tablets. A comparative evaluation of word sense disambiguation. In natural language processing, word sense disambiguation is defined as the task to assign a suitable sense of words in a certain context. What are the best algorithms for word sense disambiguation.
Parameter optimization for machinelearning of word sense. Comparison of global algorithms in word sense disambiguation. The task of word sense disambiguation consists of assigning the most appropriate meaning to a polysemous word within a given context. Chen p, ding w, bowes c and brown d a fully unsupervised word sense disambiguation method using dependency knowledge proceedings of human language technologies. Sep 19, 2007 the results indicate that the right combination of similarity metrics and graph centrality algorithms can lead to a performance competing with the stateoftheart in unsupervised word sense disambiguation, as measured on standard data sets. An analysis and comparison of predominant word sense. Word sense disambiguation algorithm in python stack overflow. Word sense disambiguation wsd has been a basic and ongoing issue since its introduction in natural language processing nlp community. In this paper present some general aspects regarding word sense disambiguation, the common used wsd methods and improvements in text. Keywords machine translation, word sense disambiguation, machine learning, maximum entropy model. Applications such as machine translation, knowledge acquisition, common sense reasoning, and others, require knowledge about word meanings, and word sense disambiguation is considered essential. Use features like bookmarks, note taking and highlighting while reading word sense disambiguation.
An analysis and comparison of predominant word sense disambiguation algorithms 1 1. Given a word and its possible senses, as defined by a. Word sense disambiguation wsdthe task of determining which. This thesis investigates research performed in the area of natural language processing. This is the first book to cover the entire topic of word sense disambiguation wsd including. This task plays a prominent role in a myriad of real world applications, such as machine translation, word processing and information retrieval. In natural language processing, word sense disambiguation wsd is the problem of determining which sense meaning of a word is activated by the use of the word in a particular context, a process which appears to be largely unconscious in people. Feb 05, 2016 word sense disambiguation, wsd, thesaurusbased methods, dictionarybased methods, supervised methods, lesk algorithm, michael lesk, simplified lesk, corpus le. Is there any implementation of wsd algorithms in python. This model has been extended to take into account systems that return a set of senses with weights for each occurrence.
He is author of numerous articles and six books including electric. Given an ambiguous word and the context in which the word occurs, lesk returns a synset with the highest number of overlapping words between the context sentence and different definitions from each synset. Although wsd has been researched over the years, the performance of existing algorithms in terms of accuracy and recall is still unsatisfactory. Word sense disambiguation wsd is a subfield within computational linguistics, which is also referred to as natural language processing nlp, where computer systems are designed to identify the correct meaning or sense of a word in a given context. Its not quite clear whether there is something in nltk that can help me. It is a great resource containing valuable reference material, helpful summaries of. Algorithms for wsd fall into two main groups, supervised and unsupervised. Word sense disambiguation algorithms and applications eneko. Focusing on the explicit disambiguation of word senses linked to a dictionary is not the.
What are the best algorithms for wordsensedisambiguation. Browse the amazon editors picks for the best books of 2019, featuring our favorite reads. In computational linguistics, word sense disambiguation wsd is the process of identifying which sense of a word is used in any given sentence, when the word has a number of distinct senses. In this paper, we propose a novel approach to word sense. Word sense disambiguation guide books acm digital library. In biomedicine, there is a wealth of information hidden in unstructured narratives such as research articles and clinical reports. Id be happy even with a naive implementation like lesk algorithm. To exploit these data properly, a word sense disambiguation wsd algorithm prevents downstream difficulties in the natural language processing applications pipeline. An individual is represented by a sequence of natural numbers of possible word senses retrieved from a dictionary, and the lesk measure 50 is used to.
Machine learning techniques for word sense disambiguation. Word sense disambiguation wsd, an aicomplete problem, is shown to be able to solve the essential problems of artificial intelligence, and has received increasing attention due to its promising applications in the fields of sentiment analysis, information retrieval, information extraction. In this research, we conduct an experiment with adapted lesk algorithm compared to original lesk algorithm to improve the performance of weighted graphbased word sense disambiguation. An overview of wsd for indian languages is described in. Im developing a simple nlp project, and im looking, given a text and a word, find the most likely sense of that word in the text. A word can have multiple meanings and such words are called polysemy. Word sense disambiguation wsd is a difficult problem for nlp. The task of word sense disambiguation wsd is to assign a sense label to a word. Semantic relatedness measures in order to be able to apply a wide range of wsd algo. Covers the topic of word sense disambiguation wsd including. Performs the classic lesk algorithm for word sense disambiguation wsd using a the definitions of the ambiguous word.
Word sense disambiguation takes an important role and considered as the core research problem in computational linguistics. This collection serves as a thorough record of where we are now and provides some nice pointers for where we need to go. Word sense disambiguation wsd is the problem of finding the correct sense i. Word sense disambiguation wsd or lexical ambiguity resolution is a fundamental task, which processes to identify the sense of a word in a given sentence. For example, consider two examples of the distinct senses that exist for the word bass. I read a lot of posts, and each one proves in a research document that a specific algorithm is the best, this is very confusing. It covers major algorithms, techniques, performance measures, results, philosophical issues and applications. Sense disambiguation for punjabi language using supervised.
The text synthesizes past and current research across the field, and helps developers grasp. The method is also shown to exceed the performance of other previously proposed unsupervised word sense disambiguation algorithms. In terms of performance, supervised wsd approaches are superior in. Algorithms and applications text, speech and language technology book.
Performance analysis of recent word sense disambiguation. In nlp area, ambiguity is recognized as a barrier to human language understanding. Algorithms and applications text, speech and language technology book 33 kindle edition by eneko agirre, philip edmonds. Thus, general nlp books dedicate separate chapters to wsd manning and. I just come up with 2 realizations 1lesk algorithm is deprecated, 2adapted lesk is good but not the best. In computational linguistics, word sense disambiguation wsd is an open problem concerned with identifying which sense of a word is used in a sentence. While interpreting the specific meaning of acronyms and abbreviations within a sentence is often easy for a human reader, this process is nontrivial for a machine 10,11. Adapted weighted graph for word sense disambiguation ieee. Knowledgebased biomedical word sense disambiguation. Oct 31, 2019 automatic identification of a meaning of a word in a context is termed as word sense disambiguation wsd.
Mihalcea, 2011, and entire books or chapters thereof. It is one of the central challenges in nlp and is ubiquitous across all languages. Word sense disambiguation is the process to find best sense of ambiguous word from the existing senses to remove the ambiguity. In addition, we evaluate separately the performance on nouns only, verbs only, and all words. In this paper, an explicit wsd system for punjabi language using supervised techniques has been. The word sense disambiguation wsd task aims at identifying the meaning of words in a given context for specific words conveying multiple meanings. Leading researchers in the field have contributed chapters that synthesize and provide an overview of past and stateoftheart research across the field. In this research, we conduct an experiment with adapted lesk algorithm compared to original lesk algorithm to improve the performance. Most commonly supervised machine learning algorithms were used to solve this problem and improve the performance.
Lexical ambiguity resolution or word sense disambiguation wsd is the problem of assigning the. An integration of supervised and unsupervised machine. It is the aim of this research to compare a selection of predominant word sense disambiguation algorithms, and also determine if they can be optimised. It is a vital and hard artificial intelligence problem used in several natural language processing applications like machine translation, question answering, information retrieval, etc.
957 436 17 42 1143 1023 94 1354 1065 1283 555 282 365 31 1500 322 428 535 1534 124 1141 259 1043 259 448 1375 925 139 1470 1434 488 536 1078 715 56 1173