SIGDOC '86 Proceedings of the 5th annual international conference on Systems documentation
Discovery of linguistic relations using lexical attraction
Discovery of linguistic relations using lexical attraction
The interaction of knowledge sources in word sense disambiguation
Computational Linguistics
Using syntactic dependency as local context to resolve word sense ambiguity
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
HLT '93 Proceedings of the workshop on Human Language Technology
Topic models for word sense disambiguation and token-based idiom detection
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Unsupervised word sense disambiguation with lexical chains and graph-based context formalization
LTC'09 Proceedings of the 4th conference on Human language technology: challenges for computer science and linguistics
| Hi-index | 0.00 |
This article introduces an unsupervised word sense disambiguation algorithm that is inspired by the lexical attraction models of Yuret (1998). It is based on the assumption that the meanings of the words that form a sentence can be best assigned by constructing an interpretation of the whole sentence. This interpretation is facilitated by a dependency-like context specification of a content word within the sentence. Thus, finding the context words of a target word is a matter of finding a pseudo-syntactic dependency analysis of the sentence, called a linkage.