Kernel methods for minimally supervised WSD

31Citations
Citations of this article
109Readers
Mendeley users who have this article in their library.

Abstract

We present a semi-supervised technique for word sense disambiguation that exploits external knowledge acquired in an unsupervised manner. In particular, we use a combination of basic kernel functions to independently estimate syntagmatic and domain similarity, building a set of word-expert classifiers that share a common domain model acquired from a large corpus of un-labeled data. The results show that the proposed approach achieves state-of-the-art performance on a wide range of lexical sample tasks and on the English all-words task of Senseval-3, although it uses a considerably smaller number of training examples than other methods. © 2009 Association for Computational Linguistics.

Cite

CITATION STYLE

APA

Giuliano, C., Gliozzo, A. M., & Strapparava, C. (2009). Kernel methods for minimally supervised WSD. Computational Linguistics, 35(4), 513–528. https://doi.org/10.1162/coli.2009.35.4.35407

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free