A chain dictionary method for Word Sense Disambiguation and applications

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

A large class of unsupervised algorithms for Word Sense Disambiguation (WSD) is that of dictionary-based methods. Various algorithms have as the root Lesk's algorithm, which exploits the sense definitions in the dictionary directly. Our approach uses the lexical base WordNet for a new algorithm originated in Lesk's, namely "chain algorithm for disambiguation of all words", CHAD. We show how translation from a language into another one and also text entailment verification could be accomplished by this disambiguation.
8 pages, 5 figures

Keywords

Computation and Language, I.2.7

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/212790

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0806.2581
 http://arxiv.org/abs/0806.2581
 Studia Universitatis Babes-Bolyai, Special Issue, KEPT 2007, Knowledge Engineering: Principles and Technologies, Cluj-Napoca, June 6-8, 2007, pp 33-40,

Collections

arXiv