Sciweavers

1826 search results - page 23 / 366
» Using Random Forests in the Structured Language Model
Sort
View
IJCAI
2007
13 years 10 months ago
Simple Training of Dependency Parsers via Structured Boosting
Recently, significant progress has been made on learning structured predictors via coordinated training algorithms such as conditional random fields and maximum margin Markov ne...
Qin Iris Wang, Dekang Lin, Dale Schuurmans
EMNLP
2011
12 years 8 months ago
Universal Morphological Analysis using Structured Nearest Neighbor Prediction
In this paper, we consider the problem of unsupervised morphological analysis from a new angle. Past work has endeavored to design unsupervised learning methods which explicitly o...
Young-Bum Kim, João Graça, Benjamin ...
EMNLP
2009
13 years 6 months ago
Matching Reviews to Objects using a Language Model
We develop a general method to match unstructured text reviews to a structured list of objects. For this, we propose a language model for generating reviews that incorporates a de...
Nilesh N. Dalvi, Ravi Kumar, Bo Pang, Andrew Tomki...
JMLR
2012
11 years 11 months ago
Sample Complexity of Composite Likelihood
We present the first PAC bounds for learning parameters of Conditional Random Fields [12] with general structures over discrete and real-valued variables. Our bounds apply to com...
Joseph K. Bradley, Carlos Guestrin
CORR
2007
Springer
120views Education» more  CORR 2007»
13 years 8 months ago
Random subcubes as a toy model for constraint satisfaction problems
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the s...
Thierry Mora, Lenka Zdeborová