Harmony search algorithm for word sense disambiguation

Saad Adnan Abed, Sabrina Tiun, Nazlia Omar, Wen Bo Du

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Word Sense Disambiguation (WSD) is the task of determining which sense of an ambiguous word (word with multiple meanings) is chosen in a particular use of that word, by considering its context. A sentence is considered ambiguous if it contains ambiguous word(s). Practically, any sentence that has been classified as ambiguous usually has multiple interpretations, but just one of them presents the correct interpretation. We propose an unsupervised method that exploits knowledge based approaches for word sense disambiguation using Harmony Search Algorithm (HSA) based on a Stanford dependencies generator (HSDG). The role of the dependency generator is to parse sentences to obtain their dependency relations. Whereas, the goal of using the HSA is to maximize the overall semantic similarity of the set of parsed words. HSA invokes a combination of semantic similarity and relatedness measurements, i.e., Jiang and Conrath (jcn) and an adapted Lesk algorithm, to perform the HSA fitness function. Our proposed method was experimented on benchmark datasets, which yielded results comparable to the state-of-the-art WSD methods. In order to evaluate the effectiveness of the dependency generator, we perform the same methodology without the parser, but with a window of words. The empirical results demonstrate that the proposed method is able to produce effective solutions for most instances of the datasets used.

Original languageEnglish
Article number0136614
JournalPLoS One
Volume10
Issue number9
DOIs
Publication statusPublished - 30 Sep 2015

Fingerprint

generators (equipment)
Semantics
Benchmarking
methodology
Datasets

ASJC Scopus subject areas

  • Agricultural and Biological Sciences(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Medicine(all)

Cite this

Harmony search algorithm for word sense disambiguation. / Abed, Saad Adnan; Tiun, Sabrina; Omar, Nazlia; Du, Wen Bo.

In: PLoS One, Vol. 10, No. 9, 0136614, 30.09.2015.

Research output: Contribution to journalArticle

Abed, Saad Adnan ; Tiun, Sabrina ; Omar, Nazlia ; Du, Wen Bo. / Harmony search algorithm for word sense disambiguation. In: PLoS One. 2015 ; Vol. 10, No. 9.
@article{cf1eff1c48904d96a03cfbc3c171110c,
title = "Harmony search algorithm for word sense disambiguation",
abstract = "Word Sense Disambiguation (WSD) is the task of determining which sense of an ambiguous word (word with multiple meanings) is chosen in a particular use of that word, by considering its context. A sentence is considered ambiguous if it contains ambiguous word(s). Practically, any sentence that has been classified as ambiguous usually has multiple interpretations, but just one of them presents the correct interpretation. We propose an unsupervised method that exploits knowledge based approaches for word sense disambiguation using Harmony Search Algorithm (HSA) based on a Stanford dependencies generator (HSDG). The role of the dependency generator is to parse sentences to obtain their dependency relations. Whereas, the goal of using the HSA is to maximize the overall semantic similarity of the set of parsed words. HSA invokes a combination of semantic similarity and relatedness measurements, i.e., Jiang and Conrath (jcn) and an adapted Lesk algorithm, to perform the HSA fitness function. Our proposed method was experimented on benchmark datasets, which yielded results comparable to the state-of-the-art WSD methods. In order to evaluate the effectiveness of the dependency generator, we perform the same methodology without the parser, but with a window of words. The empirical results demonstrate that the proposed method is able to produce effective solutions for most instances of the datasets used.",
author = "Abed, {Saad Adnan} and Sabrina Tiun and Nazlia Omar and Du, {Wen Bo}",
year = "2015",
month = "9",
day = "30",
doi = "10.1371/journal.pone.0136614",
language = "English",
volume = "10",
journal = "PLoS One",
issn = "1932-6203",
publisher = "Public Library of Science",
number = "9",

}

TY - JOUR

T1 - Harmony search algorithm for word sense disambiguation

AU - Abed, Saad Adnan

AU - Tiun, Sabrina

AU - Omar, Nazlia

AU - Du, Wen Bo

PY - 2015/9/30

Y1 - 2015/9/30

N2 - Word Sense Disambiguation (WSD) is the task of determining which sense of an ambiguous word (word with multiple meanings) is chosen in a particular use of that word, by considering its context. A sentence is considered ambiguous if it contains ambiguous word(s). Practically, any sentence that has been classified as ambiguous usually has multiple interpretations, but just one of them presents the correct interpretation. We propose an unsupervised method that exploits knowledge based approaches for word sense disambiguation using Harmony Search Algorithm (HSA) based on a Stanford dependencies generator (HSDG). The role of the dependency generator is to parse sentences to obtain their dependency relations. Whereas, the goal of using the HSA is to maximize the overall semantic similarity of the set of parsed words. HSA invokes a combination of semantic similarity and relatedness measurements, i.e., Jiang and Conrath (jcn) and an adapted Lesk algorithm, to perform the HSA fitness function. Our proposed method was experimented on benchmark datasets, which yielded results comparable to the state-of-the-art WSD methods. In order to evaluate the effectiveness of the dependency generator, we perform the same methodology without the parser, but with a window of words. The empirical results demonstrate that the proposed method is able to produce effective solutions for most instances of the datasets used.

AB - Word Sense Disambiguation (WSD) is the task of determining which sense of an ambiguous word (word with multiple meanings) is chosen in a particular use of that word, by considering its context. A sentence is considered ambiguous if it contains ambiguous word(s). Practically, any sentence that has been classified as ambiguous usually has multiple interpretations, but just one of them presents the correct interpretation. We propose an unsupervised method that exploits knowledge based approaches for word sense disambiguation using Harmony Search Algorithm (HSA) based on a Stanford dependencies generator (HSDG). The role of the dependency generator is to parse sentences to obtain their dependency relations. Whereas, the goal of using the HSA is to maximize the overall semantic similarity of the set of parsed words. HSA invokes a combination of semantic similarity and relatedness measurements, i.e., Jiang and Conrath (jcn) and an adapted Lesk algorithm, to perform the HSA fitness function. Our proposed method was experimented on benchmark datasets, which yielded results comparable to the state-of-the-art WSD methods. In order to evaluate the effectiveness of the dependency generator, we perform the same methodology without the parser, but with a window of words. The empirical results demonstrate that the proposed method is able to produce effective solutions for most instances of the datasets used.

UR - http://www.scopus.com/inward/record.url?scp=84947807084&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84947807084&partnerID=8YFLogxK

U2 - 10.1371/journal.pone.0136614

DO - 10.1371/journal.pone.0136614

M3 - Article

C2 - 26422368

AN - SCOPUS:84947807084

VL - 10

JO - PLoS One

JF - PLoS One

SN - 1932-6203

IS - 9

M1 - 0136614

ER -