4 |
Learning Taxonomy for Text Segmentation by Formal Concept Analysis ...
|
|
|
|
BASE
|
|
Show details
|
|
5 |
Textual Entailment Recognizing by Theorem Proving Approach ...
|
|
|
|
BASE
|
|
Show details
|
|
6 |
A chain dictionary method for Word Sense Disambiguation and applications ...
|
|
|
|
Abstract:
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 ...
|
|
Keyword:
Computation and Language cs.CL; FOS Computer and information sciences; I.2.7
|
|
URL: https://arxiv.org/abs/0806.2581 https://dx.doi.org/10.48550/arxiv.0806.2581
|
|
BASE
|
|
Hide details
|
|
8 |
An Evaluation Exercise for Romanian Word Sense Disambiguation
|
|
|
|
In: Third Annual Association for Computational Linguistics Special Interest Group on the Lexicon (ACL/SIGLEX), 2004, Barcelona, Spain (2004)
|
|
BASE
|
|
Show details
|
|
|
|