Boosting Applied to Word Sense Disambiguation
Gerard Escudero, Lluis Marquez, German Rigau
Abstract
In this paper Schapire and Singer's AdaBoost.MH boosting algorithm is applied to the Word Sense Disambiguation (WSD) problem. Initial experiments on a set of 15 selected polysemous words show that the boosting approach surpasses Naive Bayes and Exemplar-based approaches, which represent state-of-the-art accuracy on supervised WSD. In order to make boosting practical for a real learning domain of thousands of words, several ways of accelerating the algorithm by reducing the feature space are studied. The best variant, which we call LazyBoosting, is tested on the largest sense-tagged corpus available containing 192,800 examples of the 191 most frequent and ambiguous English words. Again, boosting compares favourably to the other benchmark algorithms.
Create a lesson
Related papers
MixLID: Token-Level Language Identification in Mixed-Language Text
Seongtae Hong, Youngjoon Jang, Seungyoon Lee et al.
Know Yourself and Know Your Neighbour: A Syntactically Informed Self-Supervised Compositional Sentence Representation Learning Framework using a Recursive Hypernetwork
Vasudevan Nedumpozhimana, John Kelleher
PatTransBench: an ipc-stratified, multi-dimensional benchmark for patent machine translation evaluation
Xiaowei Su, Xusen Cheng
Spectral-Driven Adaptive-Rank Optimizer for Large Language Model Reinforcement Learning with Verifiable Rewards
Zhipeng Chen, Wayne Xin Zhao, Ji-Rong Wen
Support or Magnitude? Characterizing Neuron Relevance for Instruction Data Selection
Yifan Le
Intent-Triggered Anchoring for Multi-Token Format Units in Parallel Decoding of Diffusion Language Models
Junhyeok Lee, Kyu Sung Choi