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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
