Learning Probabilistic Models of Word Sense Disambiguation

Computer Science – Computation and Language

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

195 pages

Scientific paper

This dissertation presents several new methods of supervised and unsupervised learning of word sense disambiguation models. The supervised methods focus on performing model searches through a space of probabilistic models, and the unsupervised methods rely on the use of Gibbs Sampling and the Expectation Maximization (EM) algorithm. In both the supervised and unsupervised case, the Naive Bayesian model is found to perform well. An explanation for this success is presented in terms of learning rates and bias-variance decompositions.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Learning Probabilistic Models of 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 Learning Probabilistic Models of Word Sense Disambiguation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Learning Probabilistic Models of Word Sense Disambiguation will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-41043

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.