Sciweavers

250 search results - page 38 / 50
» Learning Probabilistic Models of Word Sense Disambiguation
Sort
View
NIPS
2001
14 years 11 months ago
Grammatical Bigrams
Unsupervised learning algorithms have been derived for several statistical models of English grammar, but their computational complexity makes applying them to large data sets int...
Mark A. Paskin
COLING
2010
14 years 4 months ago
Value for Money: Balancing Annotation Effort, Lexicon Building and Accuracy for Multilingual WSD
Sense annotation and lexicon building are costly affairs demanding prudent investment of resources. Recent work on multilingual WSD has shown that it is possible to leverage the a...
Mitesh M. Khapra, Saurabh Sohoney, Anup Kulkarni, ...
ICDAR
2007
IEEE
15 years 4 months ago
Fast Lexicon-Based Scene Text Recognition with Sparse Belief Propagation
Using a lexicon can often improve character recognition under challenging conditions, such as poor image quality or unusual fonts. We propose a flexible probabilistic model for c...
Jerod J. Weinman, Erik G. Learned-Miller, Allen R....
UAI
2008
14 years 11 months ago
Latent Topic Models for Hypertext
Latent topic models have been successfully applied as an unsupervised topic discovery technique in large document collections. With the proliferation of hypertext document collect...
Amit Gruber, Michal Rosen-Zvi, Yair Weiss
ICML
2006
IEEE
15 years 10 months ago
Topic modeling: beyond bag-of-words
Some models of textual corpora employ text generation methods involving n-gram statistics, while others use latent topic variables inferred using the "bag-of-words" assu...
Hanna M. Wallach