A Composite Kernel for Word Sense Disambiguation

Article Preview

Abstract:

The success of supervised learning approaches to word sensed disambiguation (WSD) is largely dependent on the representation of the context in which an ambiguous word occurs. In practice, different kernel functions can be designed according to different representations since kernels can be well defined on general types of data, such as vectors, sequences, trees, as well as graphs. In this paper, we present a composite kernel, which is a linear combination of two types of kernels, i.e., bag of words (BOW) kernel and sequence kernel, for WSD. The benefit of kernel combination is that it allows to integrate heterogeneous sources of information in a simple and effective way. Empirical evaluation shows that the composite kernel can consistently improve the performance of WSD.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

522-525

Citation:

Online since:

February 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] N. Ide and J. Véronis. Introduction to the special issue on word sense disambiguation: the state of the art. Computational Linguistics 24(1) (1998): 1-40.

Google Scholar

[2] J. Shawe-Taylor and N. Cristianini. Kernel methods for pattern analysis. Cambridge University Press, Cambridge (2004).

Google Scholar

[3] Y.K. Lee and H.T. Ng. An empirical evaluation of knowledge sources and learning algorithms for word sense disambiguation. In: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2002): 41-48.

DOI: 10.3115/1118693.1118699

Google Scholar

[4] M. Popescu. Regularized least-squares classification for word sense disambiguation. In: Proceedings of the 3rd International Workshop on the Evaluation of Systems for the Semantic Analysis of Text (Senseval-3) (2004): 209-212.

Google Scholar

[5] C. Giuliano, A. Gliozzo and C. Strapparava. Kernel methods for minimally supervised WSD. Computational Linguistics 35(4) (2009): 513-528.

DOI: 10.1162/coli.2009.35.4.35407

Google Scholar

[6] T. Wang, J. Rao and D. Zhao. Using exponential kernel for word sense disambiguation. In: Proceedings of the 23rd International Conference on Artificial Neural Networks, LNCS 8131 (2013): 545–552.

DOI: 10.1007/978-3-642-40728-4_68

Google Scholar

[7] N. Cancedda, E. Gaussier, C. Goutte and J. -M. Renders. Word-sequences kernels. Journal of Machine Learning Research 3 (2003): 1059-1082.

Google Scholar