scholarly journals WORD SENSE DISAMBIGUATION METHOD USING SEMANTIC SIMILARITY MEASURES AND OWA OPERATOR

2015 ◽  
Vol 05 (02) ◽  
pp. 896-904 ◽  
Author(s):  
Kanika Mittal ◽  
◽  
Amita Jain ◽  
Keyword(s):  
Semantic Similarity ◽  
Word Sense Disambiguation ◽  
Similarity Measures ◽  
Word Sense ◽  
Owa Operator ◽  
Sense Disambiguation

Ontology Matching using BabelNet Dictionary and Word Sense Disambiguation Algorithms

2017 ◽  
Vol 5 (1) ◽  
pp. 196 ◽  
Author(s):  
Mohamed Biniz ◽  
Rachid El Ayachi ◽  
Mohamed Fakir
Keyword(s):  
Natural Language Processing ◽  
Language Processing ◽  
Word Sense Disambiguation ◽  
Similarity Measures ◽  
Ontology Matching ◽  
Word Sense ◽  
Sense Disambiguation ◽  
Lesk Algorithm ◽  
Reference Ontology ◽  
Selection Of

<p>Ontology matching is a discipline that means two things: first, the process of discovering correspondences between two different ontologies, and second is the result of this process, that is to say the expression of correspondences. This discipline is a crucial task to solve problems merging and evolving of heterogeneous ontologies in applications of the Semantic Web. This domain imposes several challenges, among them, the selection of appropriate similarity measures to discover the correspondences. In this article, we are interested to study algorithms that calculate the semantic similarity by using Adapted Lesk algorithm, Wu &amp; Palmer Algorithm, Resnik Algorithm, Leacock and Chodorow Algorithm, and similarity flooding between two ontologies and BabelNet as reference ontology, we implement them, and compared experimentally. Overall, the most effective methods are Wu &amp; Palmer and Adapted Lesk, which is widely used for Word Sense Disambiguation (WSD) in the field of Automatic Natural Language Processing (NLP).</p>

scholarly journals A Game-Theoretic Approach to Word Sense Disambiguation

2017 ◽  
Vol 43 (1) ◽  
pp. 31-70 ◽  
Author(s):  
Rocco Tripodi ◽  
Marcello Pelillo
Keyword(s):  
Game Theory ◽  
State Of The Art ◽  
Constraint Satisfaction Problem ◽  
Word Sense Disambiguation ◽  
Evolutionary Game ◽  
Similarity Measures ◽  
Theoretic Approach ◽  
Word Sense ◽  
Sense Disambiguation ◽  
Distributional Information

This article presents a new model for word sense disambiguation formulated in terms of evolutionary game theory, where each word to be disambiguated is represented as a node on a graph whose edges represent word relations and senses are represented as classes. The words simultaneously update their class membership preferences according to the senses that neighboring words are likely to choose. We use distributional information to weigh the influence that each word has on the decisions of the others and semantic similarity information to measure the strength of compatibility among the choices. With this information we can formulate the word sense disambiguation problem as a constraint satisfaction problem and solve it using tools derived from game theory, maintaining the textual coherence. The model is based on two ideas: Similar words should be assigned to similar classes and the meaning of a word does not depend on all the words in a text but just on some of them. The article provides an in-depth motivation of the idea of modeling the word sense disambiguation problem in terms of game theory, which is illustrated by an example. The conclusion presents an extensive analysis on the combination of similarity measures to use in the framework and a comparison with state-of-the-art systems. The results show that our model outperforms state-of-the-art algorithms and can be applied to different tasks and in different scenarios.

scholarly journals Arabic Gloss WSD Using BERT

2021 ◽  
Vol 11 (6) ◽  
pp. 2567
Author(s):  
Mohammed El-Razzaz ◽  
Mohamed Waleed Fakhr ◽  
Fahima A. Maghraby
Keyword(s):  
Target Word ◽  
Semantic Similarity ◽  
Test Data ◽  
Word Sense Disambiguation ◽  
Word Sense ◽  
Written Text ◽  
Knowledge Based ◽  
Training Samples ◽  
Sense Disambiguation ◽  
Definition Of

Word Sense Disambiguation (WSD) aims to predict the correct sense of a word given its context. This problem is of extreme importance in Arabic, as written words can be highly ambiguous; 43% of diacritized words have multiple interpretations and the percentage increases to 72% for non-diacritized words. Nevertheless, most Arabic written text does not have diacritical marks. Gloss-based WSD methods measure the semantic similarity or the overlap between the context of a target word that needs to be disambiguated and the dictionary definition of that word (gloss of the word). Arabic gloss WSD suffers from a lack of context-gloss datasets. In this paper, we present an Arabic gloss-based WSD technique. We utilize the celebrated Bidirectional Encoder Representation from Transformers (BERT) to build two models that can efficiently perform Arabic WSD. These models can be trained with few training samples since they utilize BERT models that were pretrained on a large Arabic corpus. Our experimental results show that our models outperform two of the most recent gloss-based WSDs when we test them against the same test data used to evaluate our model. Additionally, our model achieves an F1-score of 89% compared to the best-reported F1-score of 85% for knowledge-based Arabic WSD. Another contribution of this paper is introducing a context-gloss benchmark that may help to overcome the lack of a standardized benchmark for Arabic gloss-based WSD.

scholarly journals Developing Corpora using Wikipedia and Word2vec for Word Sense Disambiguation

2018 ◽  
Vol 12 (3) ◽  
pp. 1239
Author(s):  
Farza Nurifan ◽  
Riyanarto Sarno ◽  
Cahyaningtyas Sekar Wahyuni
Keyword(s):  
Semantic Similarity ◽  
Word Sense Disambiguation ◽  
Ambiguous Word ◽  
Anaphora Resolution ◽  
Word Sense ◽  
Accuracy Rate ◽  
Ambiguous Words ◽  
Sense Disambiguation ◽  
Improve Accuracy ◽  
Research Show

Word Sense Disambiguation (WSD) is one of the most difficult problems in the artificial intelligence field or well known as AI-hard or AI-complete. A lot of problems can be solved using word sense disambiguation approaches like sentiment analysis, machine translation, search engine relevance, coherence, anaphora resolution, and inference. In this paper, we do research to solve WSD problem with two small corpora. We propose the use of Word2vec and Wikipedia to develop the corpora. After developing the corpora, we measure the sentence similarity with the corpora using cosine similarity to determine the meaning of the ambiguous word. Lastly, to improve accuracy, we use Lesk algorithms and Wu Palmer similarity to deal with problems when there is no word from a sentence in the corpora (we call it as semantic similarity). The results of our research show an 86.94% accuracy rate and the semantic similarity improve the accuracy rate by 12.96% in determining the meaning of ambiguous words.

Sign in / Sign up

Export Citation Format

Share Document