Computer Science – Computation and Language
Scientific paper
2000-07-07
Proceedings of the 11th European Conference on Machine Learning, ECML'2000 pp. 129-141
Computer Science
Computation and Language
12 pages
Scientific paper
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.
Escudero Gerard
Marquez Lluis
Rigau German
No associations
LandOfFree
Boosting Applied to Word Sense Disambiguation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Boosting Applied to Word Sense Disambiguation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Boosting Applied to Word Sense Disambiguation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-574827