Sciweavers

807 search results - page 7 / 162
» Learning with Probabilistic Features for Improved Pipeline M...
Sort
View
ITS
2010
Springer
157views Multimedia» more  ITS 2010»
14 years 5 days ago
A Computational Model of Accelerated Future Learning through Feature Recognition
Accelerated future learning, in which learning proceeds more effectively and more rapidly because of prior learning, is considered to be one of the most interesting measures of ro...
Nan Li, William W. Cohen, Kenneth R. Koedinger
EMNLP
2004
13 years 8 months ago
Max-Margin Parsing
We present a novel discriminative approach to parsing inspired by the large-margin criterion underlying support vector machines. Our formulation uses a factorization analogous to ...
Ben Taskar, Dan Klein, Mike Collins, Daphne Koller...
NLPRS
2001
Springer
13 years 12 months ago
A Maximum Entropy Tagger with Unsupervised Hidden Markov Models
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...
Jun'ichi Kazama, Yusuke Miyao, Jun-ichi Tsujii
ICML
2009
IEEE
14 years 8 months ago
Learning structurally consistent undirected probabilistic graphical models
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
Sushmita Roy, Terran Lane, Margaret Werner-Washbur...
EMNLP
2007
13 years 8 months ago
A Topic Model for Word Sense Disambiguation
We develop latent Dirichlet allocation with WORDNET (LDAWN), an unsupervised probabilistic topic model that includes word sense as a hidden variable. We develop a probabilistic po...
Jordan L. Boyd-Graber, David M. Blei, Xiaojin Zhu