A chain dictionary method for Word Sense Disambiguation and applications
| dc.creator | Tatar, Doina | |
| dc.creator | Serban, Gabriela | |
| dc.creator | Mihis, Andreea | |
| dc.creator | Lupea, Mihaiela | |
| dc.creator | Lupsa, Dana | |
| dc.creator | Frentiu, Militon | |
| dc.date | 2008-06-16 | |
| dc.date.accessioned | 2026-07-07T12:19:32Z | |
| dc.date.available | 2026-07-07T12:19:32Z | |
| dc.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. | |
| dc.description | 8 pages, 5 figures | |
| dc.identifier | https://arxiv.org/abs/0806.2581 | |
| dc.identifier | http://arxiv.org/abs/0806.2581 | |
| dc.identifier | Studia Universitatis Babes-Bolyai, Special Issue, KEPT 2007, Knowledge Engineering: Principles and Technologies, Cluj-Napoca, June 6-8, 2007, pp 33-40, | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/212790 | |
| dc.subject | Computation and Language | |
| dc.subject | I.2.7 | |
| dc.title | A chain dictionary method for Word Sense Disambiguation and applications | |
| dc.type | text |