scholarly journals Improving the state-of-the-art in Thai semantic similarity using distributional semantics and ontological information

PLoS ONE ◽  
2021 ◽  
Vol 16 (2) ◽  
pp. e0246751
Author(s):  
Ponrudee Netisopakul ◽  
Gerhard Wohlgenannt ◽  
Aleksei Pulich ◽  
Zar Zar Hlaing
Keyword(s):  
Semantic Similarity ◽  
Language Processing ◽  
English Language ◽  
State Of The Art ◽  
Word Sense Disambiguation ◽  
Similarity Score ◽  
The State ◽  
Word Sense ◽  
Word Level ◽  
High Fraction

Research into semantic similarity has a long history in lexical semantics, and it has applications in many natural language processing (NLP) tasks like word sense disambiguation or machine translation. The task of calculating semantic similarity is usually presented in the form of datasets which contain word pairs and a human-assigned similarity score. Algorithms are then evaluated by their ability to approximate the gold standard similarity scores. Many such datasets, with different characteristics, have been created for English language. Recently, four of those were transformed to Thai language versions, namely WordSim-353, SimLex-999, SemEval-2017-500, and R&G-65. Given those four datasets, in this work we aim to improve the previous baseline evaluations for Thai semantic similarity and solve challenges of unsegmented Asian languages (particularly the high fraction of out-of-vocabulary (OOV) dataset terms). To this end we apply and integrate different strategies to compute similarity, including traditional word-level embeddings, subword-unit embeddings, and ontological or hybrid sources like WordNet and ConceptNet. With our best model, which combines self-trained fastText subword embeddings with ConceptNet Numberbatch, we managed to raise the state-of-the-art, measured with the harmonic mean of Pearson on Spearman ρ, by a large margin from 0.356 to 0.688 for TH-WordSim-353, from 0.286 to 0.769 for TH-SemEval-500, from 0.397 to 0.717 for TH-SimLex-999, and from 0.505 to 0.901 for TWS-65.

scholarly journals Graph Algorithms for Word Sense Disambiguation in Biomedicine

2015 ◽  
Author(s):  
Rodrigo Goulart ◽  
Juliano De Carvalho ◽  
Vera De Lima
Keyword(s):  
Text Mining ◽  
Graph Algorithms ◽  
State Of The Art ◽  
Word Sense Disambiguation ◽  
The State ◽  
Word Sense ◽  
New Approach ◽  
Similar Performance ◽  
Sense Disambiguation ◽  
Different Levels

Word Sense Disambiguation (WSD) is an important task for Biomedicine text-mining. Supervised WSD methods have the best results but they are complex and their cost for testing is too high. This work presents an experiment on WSD using graph-based approaches (unsupervised methods). Three algorithms were tested and compared to the state of the art. Results indicate that similar performance could be reached with different levels of complexity, what may point to a new approach to this problem.

scholarly journals CSI: A Coarse Sense Inventory for 85% Word Sense Disambiguation

2020 ◽  
Vol 34 (05) ◽  
pp. 8123-8130
Author(s):  
Caterina Lacerra ◽  
Michele Bevilacqua ◽  
Tommaso Pasini ◽  
Roberto Navigli
Keyword(s):  
State Of The Art ◽  
Word Sense Disambiguation ◽  
Expressive Power ◽  
The State ◽  
Ease Of Use ◽  
Word Sense ◽  
The Past ◽  
Sense Disambiguation ◽  
Human Annotator ◽  
Standing Problem

Word Sense Disambiguation (WSD) is the task of associating a word in context with one of its meanings. While many works in the past have focused on raising the state of the art, none has even come close to achieving an F-score in the 80% ballpark when using WordNet as its sense inventory. We contend that one of the main reasons for this failure is the excessively fine granularity of this inventory, resulting in senses that are hard to differentiate between, even for an experienced human annotator. In this paper we cope with this long-standing problem by introducing Coarse Sense Inventory (CSI), obtained by linking WordNet concepts to a new set of 45 labels. The results show that the coarse granularity of CSI leads a WSD model to achieve 85.9% F1, while maintaining a high expressive power. Our set of labels also exhibits ease of use in tagging and a descriptiveness that other coarse inventories lack, as demonstrated in two annotation tasks which we performed. Moreover, a few-shot evaluation proves that the class-based nature of CSI allows the model to generalise over unseen or under-represented words.

scholarly journals Recent Trends in Word Sense Disambiguation: A Survey

2021 ◽  
Author(s):  
Michele Bevilacqua ◽  
Tommaso Pasini ◽  
Alessandro Raganato ◽  
Roberto Navigli
Keyword(s):  
Glass Ceiling ◽  
State Of The Art ◽  
Word Sense Disambiguation ◽  
Representation Learning ◽  
The State ◽  
Word Sense ◽  
Performance Improvements ◽  
Sense Disambiguation ◽  
The Future ◽  
Recent Trends

Word Sense Disambiguation (WSD) aims at making explicit the semantics of a word in context by identifying the most suitable meaning from a predefined sense inventory. Recent breakthroughs in representation learning have fueled intensive WSD research, resulting in considerable performance improvements, breaching the 80% glass ceiling set by the inter-annotator agreement. In this survey, we provide an extensive overview of current advances in WSD, describing the state of the art in terms of i) resources for the task, i.e., sense inventories and reference datasets for training and testing, as well as ii) automatic disambiguation approaches, detailing their peculiarities, strengths and weaknesses. Finally, we highlight the current limitations of the task itself, but also point out recent trends that could help expand the scope and applicability of WSD, setting up new promising directions for the future.

scholarly journals Semi-supervised Learning with Induced Word Senses for State of the Art Word Sense Disambiguation

2016 ◽  
Vol 55 ◽  
pp. 1025-1058 ◽  
Author(s):  
Osman Başkaya ◽  
David Jurgens
Keyword(s):  
Supervised Learning ◽  
Language Processing ◽  
High Performance ◽  
State Of The Art ◽  
Word Sense Disambiguation ◽  
Word Type ◽  
Word Sense ◽  
Benefit Evaluation ◽  
Word Sense Induction ◽  
Sense Disambiguation

Word Sense Disambiguation (WSD) aims to determine the meaning of a word in context, and successful approaches are known to benefit many applications in Natural Language Processing. Although supervised learning has been shown to provide superior WSD performance, current sense-annotated corpora do not contain a sufficient number of instances per word type to train supervised systems for all words. While unsupervised techniques have been proposed to overcome this data sparsity problem, such techniques have not outperformed supervised methods. In this paper, we propose a new approach to building semi-supervised WSD systems that combines a small amount of sense-annotated data with information from Word Sense Induction, a fully-unsupervised technique that automatically learns the different senses of a word based on how it is used. In three experiments, we show how sense induction models may be effectively combined to ultimately produce high-performance semi-supervised WSD systems that exceed the performance of state-of-the-art supervised WSD techniques trained on the same sense-annotated data. We anticipate that our results and released software will also benefit evaluation practices for sense induction systems and those working in low-resource languages by demonstrating how to quickly produce accurate WSD systems with minimal annotation effort.

SePaS: Word sense disambiguation by sequential patterns in sentences

2013 ◽  
Vol 21 (2) ◽  
pp. 251-269 ◽  
Author(s):  
MASOUD NAROUEI ◽  
MANSOUR AHMADI ◽  
ASHKAN SAMI
Keyword(s):  
Language Processing ◽  
State Of The Art ◽  
Word Sense Disambiguation ◽  
Word Sense ◽  
Variable Size ◽  
Data Mining Algorithms ◽  
Proper Size ◽  
Sense Disambiguation ◽  
N Gram ◽  
Mining Algorithms

AbstractAn open problem in natural language processing is word sense disambiguation (WSD). A word may have several meanings, but WSD is the task of selecting the correct sense of a polysemous word based on its context. Proposed solutions are based on supervised and unsupervised learning methods. The majority of researchers in the area focused on choosing proper size of ‘n’ in n-gram that is used for WSD problem. In this research, the concept has been taken to a new level by using variable ‘n’ and variable size window. The concept is based on the iterative patterns extracted from the text. We show that this type of sequential pattern is more effective than many other solutions for WSD. Using regular data mining algorithms on the extracted features, we significantly outperformed most monolingual WSD solutions. The state-of-the-art results were obtained using external knowledge like various translations of the same sentence. Our method improved the accuracy of the multilingual system more than 4 percent, although we were using monolingual features.

scholarly journals Learning Sense Representation from Word Representation for Unsupervised Word Sense Disambiguation (Student Abstract)

2020 ◽  
Vol 34 (10) ◽  
pp. 13947-13948
Author(s):  
Jie Wang ◽  
Zhenxin Fu ◽  
Moxin Li ◽  
Haisong Zhang ◽  
Dongyan Zhao ◽  
...  
Keyword(s):  
State Of The Art ◽  
Word Sense Disambiguation ◽  
Ambiguous Word ◽  
The State ◽  
Word Sense ◽  
Sense Disambiguation ◽  
Word Representation ◽  
Sense Representation

Unsupervised WSD methods do not rely on annotated training datasets and can use WordNet. Since each ambiguous word in the WSD task exists in WordNet and each sense of the word has a gloss, we propose SGM and MGM to learn sense representations for words in WordNet using the glosses. In the WSD task, we calculate the similarity between each sense of the ambiguous word and its context to select the sense with the highest similarity. We evaluate our method on several benchmark WSD datasets and achieve better performance than the state-of-the-art unsupervised WSD systems.

scholarly journals Constructing Patent Maps Using Text Mining to Sustainably Detect Potential Technological Opportunities

2018 ◽  
Vol 10 (10) ◽  
pp. 3729 ◽  
Author(s):  
Hei Wang ◽  
Yung Chi ◽  
Ping Hsin
Keyword(s):  
Natural Language Processing ◽  
Natural Language ◽  
Language Processing ◽  
Rapid Development ◽  
Word Sense Disambiguation ◽  
Current Method ◽  
Word Sense ◽  
Competitive Advantages ◽  
Patent Documents ◽  
Technological Opportunities

With the advent of the knowledge economy, firms often compete for intellectual property rights. Being the first to acquire high-potential patents can assist firms in achieving future competitive advantages. To identify patents capable of being developed, firms often search for a focus by using existing patent documents. Because of the rapid development of technology, the number of patent documents is immense. A prominent topic among current firms is how to use this large number of patent documents to discover new business opportunities while avoiding conflicts with existing patents. In the search for technological opportunities, a crucial task is to present results in the form of an easily understood visualization. Currently, natural language processing can help in achieving this goal. In natural language processing, word sense disambiguation (WSD) is the problem of determining which “sense” (meaning) of a word is activated in a given context. Given a word and its possible senses, as defined by a dictionary, we classify the occurrence of a word in context into one or more of its sense classes. The features of the context (such as neighboring words) provide evidence for these classifications. The current method for patent document analysis warrants improvement in areas, such as the analysis of many dimensions and the development of recommendation methods. This study proposes a visualization method that supports semantics, reduces the number of dimensions formed by terms, and can easily be understood by users. Since polysemous words occur frequently in patent documents, we also propose a WSD method to decrease the calculated degrees of distortion between terms. An analysis of outlier distributions is used to construct a patent map capable of distinguishing similar patents. During the development of new strategies, the constructed patent map can assist firms in understanding patent distributions in commercial areas, thereby preventing patent infringement caused by the development of similar technologies. Subsequently, technological opportunities can be recommended according to the patent map, aiding firms in assessing relevant patents in commercial areas early and sustainably achieving future competitive advantages.

Word Sense Disambiguation

2013 ◽  
pp. 22-51
Author(s):  
Pushpak Bhattacharyya ◽  
Mitesh Khapra
Keyword(s):  
State Of The Art ◽  
Word Sense Disambiguation ◽  
Current Trend ◽  
General Purpose ◽  
Word Sense ◽  
Domain Specific ◽  
Knowledge Based ◽  
Current State ◽  
Sense Disambiguation ◽  
State Of Affairs

This chapter discusses the basic concepts of Word Sense Disambiguation (WSD) and the approaches to solving this problem. Both general purpose WSD and domain specific WSD are presented. The first part of the discussion focuses on existing approaches for WSD, including knowledge-based, supervised, semi-supervised, unsupervised, hybrid, and bilingual approaches. The accuracy value for general purpose WSD as the current state of affairs seems to be pegged at around 65%. This has motivated investigations into domain specific WSD, which is the current trend in the field. In the latter part of the chapter, we present a greedy neural network inspired algorithm for domain specific WSD and compare its performance with other state-of-the-art algorithms for WSD. Our experiments suggest that for domain-specific WSD, simply selecting the most frequent sense of a word does as well as any state-of-the-art algorithm.

Sign in / Sign up

Export Citation Format

Share Document