2016
DOI: 10.1515/comp-2018-0015
|View full text |Cite
|
Sign up to set email alerts
|

An Optimized Lesk-Based Algorithm for Word Sense Disambiguation

Abstract: Computational complexity is a characteristic of almost all Lesk-based algorithms for word sense disambiguation (WSD). In this paper, we address this issue by developing a simple and optimized variant of the algorithm using topic composition in documents based on the theory underlying topic models. The knowledge resource adopted is the English WordNet enriched with linguistic knowledge from Wikipedia and Semcor corpus. Besides the algorithm’s eficiency, we also evaluate its efectiveness using two datasets; a ge… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
7
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
2

Relationship

2
4

Authors

Journals

citations
Cited by 10 publications
(9 citation statements)
references
References 2 publications
0
7
0
Order By: Relevance
“…In agreement with Ayetiran and Agbele [3] that definitions of words best characterize them, we need to disambiguate each word in the class topics and expand their definitions. The algorithm used for the disambiguation is an adapted and modified version of an earlier published algorithm in [3].…”
Section: Topic Disambiguationmentioning
confidence: 81%
See 3 more Smart Citations
“…In agreement with Ayetiran and Agbele [3] that definitions of words best characterize them, we need to disambiguate each word in the class topics and expand their definitions. The algorithm used for the disambiguation is an adapted and modified version of an earlier published algorithm in [3].…”
Section: Topic Disambiguationmentioning
confidence: 81%
“…In agreement with Ayetiran and Agbele [3] that definitions of words best characterize them, we need to disambiguate each word in the class topics and expand their definitions. The algorithm used for the disambiguation is an adapted and modified version of an earlier published algorithm in [3]. The only difference between the algorithm described in original algorithm and the modified version used in this work is that the latent topics learned from each language subcorpus serve as the contextual information for each target word to be disambiguated in the topics.…”
Section: Topic Disambiguationmentioning
confidence: 81%
See 2 more Smart Citations
“…In the same vein, the word "years" (the plural of second noun sense of the word "year" in WordNet) can be replaced with any of the words "months" or "weeks" in the two previous statements representing the hyponymy relation. Ayetiran and Agbele [5] and Ayetiran [4] posit that words are best characterized by their specific definitions and explore this assertion for WSD and text classification. Following up on this position, lexically related word senses have something in common in their definitions.…”
Section: Introductionmentioning
confidence: 99%