Unsupervised Word Sense Disambiguation Using Alpha-Beta Associative Memories

@article{TorresRamos2016UnsupervisedWS,
  title={Unsupervised Word Sense Disambiguation Using Alpha-Beta Associative Memories},
  author={Sulema Torres-Ramos and Israel Rom{\'a}n-God{\'i}nez and Eduardo Gerardo Mendizabal Ruiz},
  journal={Polibits},
  year={2016},
  volume={54},
  pages={43-51}
}
We present an alternative method to the use of overlapping as a distance measure in simple Lesk algorithm. This paper presents an algorithm that uses Alpha-Beta associative memory type Max and Min to measure a given ambiguous word’s meaning in relation to its context, assigning to the word the meaning that is most related. The principal advantage of using this algorithm is the ability to deal with inflectional and derivational forms of words, enabling the possibility of bypassing the stemming… 

Tables from this paper

References

SHOWING 1-10 OF 28 REFERENCES
Approaches for Word Sense Disambiguation - A Survey
TLDR
A survey of supervised, unsupervised and knowledge based approaches and algorithms available in word sense disambiguation (WSD), which aims to allow the users to make ample use of the available technologies.
Simple Window Selection Strategies for the Simplified Lesk Algorithm for Word Sense Disambiguation
TLDR
This paper proposes simple strategies for the context window selection that improve the performance of the Simplified Lesk Algorithm, including constructing the window only with words that have an overlap with some sense of the target word.
An Experimental Study of Graph Connectivity for Unsupervised Word Sense Disambiguation
TLDR
This paper introduces a graph-based WSD algorithm which has few parameters and does not require sense-annotated data for training, and investigates several measures of graph connectivity with the aim of identifying those best suited for WSD.
Applying a Naive Bayes Similarity Measure to Word Sense Disambiguation
TLDR
A simple, generalpurpose Naive Bayes model that measures many-to-many association between two sets of random variables is introduced that gains significant improvement over the Lesk algorithm on word sense disambiguation tasks.
Word sense disambiguation: A survey
TLDR
This work introduces the reader to the motivations for solving the ambiguity of words and provides a description of the task, and overviews supervised, unsupervised, and knowledge-based approaches.
Automatic sense disambiguation using machine readable dictionaries: how to tell a pine cone from an ice cream cone
TLDR
This procedure uses available dictionaries, so that it will process any text; and uses solely the immediate context to decide which sense of a word is intended (in written English).
A Quick Tour of Word Sense Disambiguation, Induction and Related Approaches
TLDR
A quick tour on how to start doing research in this exciting field of NLP and suggests the hottest topics to focus on.
Framework and Results for English SENSEVAL
TLDR
The exercise identifies the state-of-the-art for fine-grained word sense disambiguation, where training data is available, as 74–78% correct, with a number of algorithms approaching this level of performance.
Classifying Patterns in Bioinformatics Databases by Using Alpha-Beta Associative Memories
TLDR
This chapter develops a pattern classifier algorithm that works notably with bioinformatics databases, and creates an heteroasociative Alpha-Beta multimemory, as a fundamental base for the proposed classifier.
Sentiment Data Flow Analysis by Means of Dynamic Linguistic Patterns
TLDR
An algorithm that assigns contextual polarity to concepts in text and flows this polarity through the dependency arcs in order to assign a final polarity label to each sentence is presented, which enables a more efficient transformation of unstructured social data into structured information, readily interpretable by machines.
...
...