Fuzzy Logic for Inculcating Significance of Semantic Relations in Word Sense Disambiguation Using a WordNet Graph

2017 ◽  
Vol 20 (2) ◽  
pp. 444-459 ◽  
Author(s):  
Sonakshi Vij ◽  
Amita Jain ◽  
Devendra Tayal ◽  
Oscar Castillo
Keyword(s):  
Fuzzy Logic ◽  
Word Sense Disambiguation ◽  
Semantic Relations ◽  
Word Sense ◽  
Sense Disambiguation

The role of domain information in Word Sense Disambiguation

2002 ◽  
Vol 8 (4) ◽  
pp. 359-373 ◽  
Author(s):  
BERNARDO MAGNINI ◽  
CARLO STRAPPARAVA ◽  
GIOVANNI PEZZULO ◽  
ALFIO GLIOZZO
Keyword(s):  
Word Sense Disambiguation ◽  
Semantic Relations ◽  
Word Sense ◽  
Sense Disambiguation ◽  
High Level ◽  
Word Senses ◽  
Very High ◽  
Domain Information

This paper explores the role of domain information in word sense disambiguation. The underlying hypothesis is that domain labels, such as MEDICINE, ARCHITECTURE and SPORT, provide a useful way to establish semantic relations among word senses, which can be profitably used during the disambiguation process. Results obtained at the SENSEVAL-2 initiative confirm that for a significant subset of words domain information can be used to disambiguate with a very high level of precision.

A Genetic Fuzzy Semantic Web Search Agent Using Granular Semantic Trees for Ambiguous Queries

2010 ◽  
pp. 426-438
Author(s):  
Yan Chen ◽  
Yan-Qing Zhang
Keyword(s):  
Fuzzy Logic ◽  
Web Search ◽  
Word Sense Disambiguation ◽  
Knowledge Systems ◽  
Web Pages ◽  
Word Sense ◽  
Web Searching ◽  
Search Results ◽  
Sense Disambiguation ◽  
Semantic Tree

For most Web searching applications, queries are commonly ambiguous because words or phrases have different linguistic meanings for different Web users. The conventional keyword-based search engines cannot disambiguate queries to provide relevant results matching Web users’ intents. Traditional Word Sense Disambiguation (WSD) methods use statistic models or ontology-based knowledge systems to measure associations among words. The contexts of queries are used for disambiguation in these methods. However, due to the fact that numerous combinations of words may appear in queries and documents, it is difficult to extract concepts’ relations for all possible combinations. Moreover, queries are usually short, so contexts in queries do not always provide enough information to disambiguate queries. Therefore, the traditional WSD methods are not sufficient to provide accurate search results for ambiguous queries. In this chapter, a new model, Granular Semantic Tree (GST), is introduced for more conveniently representing associations among concepts than the traditional WSD methods. Additionally, users’ preferences are used to provide personalized search results that better adapt to users’ unique intents. Fuzzy logic is used to determine the most appropriate concepts related to queries based on contexts and users’ preferences. Finally, Web pages are analyzed by the GST model. The concepts of pages for the queries are evaluated, and the pages are re-ranked according to similarities of concepts between pages and queries.

scholarly journals Similarity of Semantic Relations

2006 ◽  
Vol 32 (3) ◽  
pp. 379-416 ◽  
Author(s):  
Peter D. Turney
Keyword(s):  
Information Retrieval ◽  
Word Sense Disambiguation ◽  
Semantic Relations ◽  
Word Sense ◽  
College Level ◽  
Relational Similarity ◽  
Sense Disambiguation ◽  
Potential Applications ◽  
Value Decomposition ◽  
High Degree

There are at least two kinds of similarity. Relational similarity is correspondence between relations, in contrast with attributional similarity, which is correspondence between attributes. When two words have a high degree of attributional similarity, we call them synonyms. When two pairs of words have a high degree of relational similarity, we say that their relations are analogous. For example, the word pair mason:stone is analogous to the pair carpenter:wood. This article introduces Latent Relational Analysis (LRA), a method for measuring relational similarity. LRA has potential applications in many areas, including information extraction, word sense disambiguation, and information retrieval. Recently the Vector Space Model (VSM) of information retrieval has been adapted to measuring relational similarity, achieving a score of 47% on a collection of 374 college-level multiple-choice word analogy questions. In the VSM approach, the relation between a pair of words is characterized by a vector of frequencies of predefined patterns in a large corpus. LRA extends the VSM approach in three ways: (1) The patterns are derived automatically from the corpus, (2) the Singular Value Decomposition (SVD) is used to smooth the frequency data, and (3) automatically generated synonyms are used to explore variations of the word pairs. LRA achieves 56% on the 374 analogy questions, statistically equivalent to the average human score of 57%. On the related problem of classifying semantic relations, LRA achieves similar gains over the VSM.

Extracting Concepts’ Relations and Users’ Preferences for Personalizing Query Disambiguation

2011 ◽  
pp. 66-80
Author(s):  
Yan Chen ◽  
Yan-Qing Zhang
Keyword(s):  
Word Sense Disambiguation ◽  
Ambiguous Word ◽  
Semantic Relations ◽  
Word Sense ◽  
Web Searching ◽  
Knowledge Models ◽  
Clickthrough Data ◽  
Sense Disambiguation

For most Web searching applications, queries are commonly ambiguous because words usually contain several meanings. Traditional Word Sense Disambiguation (WSD) methods use statistic models or ontology-based knowledge models to find the most appropriate sense for the ambiguous word. Since queries are usually short, the contexts of the queries may not always provide enough information for disambiguating queries. Thus, more than one interpretation may be found for one ambiguous query. In this paper, we propose a cluster-based WSD method, which finds out all appropriate interpretations for the query. Because some senses of one ambiguous word usually have very close semantic relations, we group those similar senses together for explaining the ambiguous word in one interpretation. If the cluster-based WSD method generates several contradictory interpretations for one ambiguous query, we extract users’ preferences from clickthrough data, and determine suitable concepts or concepts’ clusters that meet users’ interests for explaining the ambiguous query.

scholarly journals Modeling Semantic Relations Expressed by Prepositions

2013 ◽  
Vol 1 ◽  
pp. 231-242 ◽  
Author(s):  
Vivek Srikumar ◽  
Dan Roth
Keyword(s):  
Statistical Learning ◽  
Prediction Accuracy ◽  
Word Sense Disambiguation ◽  
Semantic Relations ◽  
Latent Structure ◽  
Word Sense ◽  
Learning Models ◽  
Sense Disambiguation ◽  
Semantic Types ◽  
Relation Prediction

This paper introduces the problem of predicting semantic relations expressed by prepositions and develops statistical learning models for predicting the relations, their arguments and the semantic types of the arguments. We define an inventory of 32 relations, building on the word sense disambiguation task for prepositions and collapsing related senses across prepositions. Given a preposition in a sentence, our computational task to jointly model the preposition relation and its arguments along with their semantic types, as a way to support the relation prediction. The annotated data, however, only provides labels for the relation label, and not the arguments and types. We address this by presenting two models for preposition relation labeling. Our generalization of latent structure SVM gives close to 90% accuracy on relation labeling. Further, by jointly predicting the relation, arguments, and their types along with preposition sense, we show that we can not only improve the relation accuracy, but also significantly improve sense prediction accuracy.

Sign in / Sign up

Export Citation Format

Share Document