250 search results - page 36 / 50 » Learning Probabilistic Models of Word Sense Disambiguation |
113
click to vote
NLPRS
2001
Springer
15 years 4 months ago
2001
Springer
We describe a new tagging model where the states of a hidden Markov model (HMM) estimated by unsupervised learning are incorporated as the features in a maximum entropy model. Our...
ICML
2003
IEEE
16 years 23 days ago
2003
IEEE
This paper addresses the problem of classification in situations where the data distribution is not homogeneous: Data instances might come from different locations or times, and t...
103
click to vote
CORR
2012
Springer
13 years 7 months ago
2012
Springer
We present sparse topical coding (STC), a non-probabilistic formulation of topic models for discovering latent representations of large collections of data. Unlike probabilistic t...
TCS
2010
14 years 10 months ago
2010
In the inductive inference framework of learning in the limit, a variation of the bounded example memory (Bem) language learning model is considered. Intuitively, the new model co...
EMNLP
2008
15 years 1 months ago
2008
Previously topic models such as PLSI (Probabilistic Latent Semantic Indexing) and LDA (Latent Dirichlet Allocation) were developed for modeling the contents of plain texts. Recent...