Sciweavers

836 search results - page 125 / 168
» Robust Probabilistic Calibration
Sort
View
CIKM
2008
Springer
14 years 11 months ago
A latent variable model for query expansion using the hidden markov model
We propose a novel probabilistic method based on the Hidden Markov Model (HMM) to learn the structure of a Latent Variable Model (LVM) for query language modeling. In the proposed...
Qiang Huang, Dawei Song
EMNLP
2007
14 years 11 months ago
What is the Jeopardy Model? A Quasi-Synchronous Grammar for QA
This paper presents a syntax-driven approach to question answering, specifically the answer-sentence selection problem for short-answer questions. Rather than using syntactic fea...
Mengqiu Wang, Noah A. Smith, Teruko Mitamura
AAAI
2006
14 years 11 months ago
Prob-Maxn: Playing N-Player Games with Opponent Models
Much of the work on opponent modeling for game tree search has been unsuccessful. In two-player, zero-sum games, the gains from opponent modeling are often outweighed by the cost ...
Nathan R. Sturtevant, Martin Zinkevich, Michael H....
ACL
2006
14 years 11 months ago
Bootstrapping Path-Based Pronoun Resolution
We present an approach to pronoun resolution based on syntactic paths. Through a simple bootstrapping procedure, we learn the likelihood of coreference between a pronoun and a can...
Shane Bergsma, Dekang Lin
NIPS
2001
14 years 11 months ago
Partially labeled classification with Markov random walks
To classify a large number of unlabeled examples we combine a limited number of labeled examples with a Markov random walk representation over the unlabeled examples. The random w...
Martin Szummer, Tommi Jaakkola