|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
A Hierarchical Bayesian Language Model based on Pitman-Yor Processes
If you have a question about this talk, please contact Shakir Mohamed.
I will be discussing:
N-gram language modelling traditionally uses some form of “smoothing” technique to allocate some probability mass to unseen N-grams. Over the years people have come up with smoothing schemes that perform pretty well, but it’s not easy to get a handle on what they’re doing, and how to improve them.
In this paper, Teh shows that a hierarchical Bayesian language model with a very simplistic model of context performs pretty much as well as the current state of the art smoothing schemes, and in fact has strong similarities to an existing smoothing scheme.
This talk is part of the Machine Learning Reading Group @ CUED series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsGeometry, Integrability and Twistor Theory Cambridge Post-Conflict and Post-Crisis Group Rouse Ball Lectures
Other talksSingle molecule spectroscopy Skill, work and pay in London building trades, 1660 - 1790 Lunchtime Talks Discrete spectrum of Schroedinger operators with oscillating decaying potentials Life on the edge: language and story telling in a cold place Mass Rapid Transit Jakarta: Rescuing a $1bn project