Sciweavers

282 search results - page 8 / 57
» Online Learning of Approximate Dependency Parsing Algorithms
Sort
View
ACL
2010
13 years 5 months ago
Dynamic Programming for Linear-Time Incremental Parsing
Incremental parsing techniques such as shift-reduce have gained popularity thanks to their efficiency, but there remains a major problem: the search is greedy and only explores a ...
Liang Huang, Kenji Sagae
EMNLP
2009
13 years 5 months ago
Bilingually-Constrained (Monolingual) Shift-Reduce Parsing
Jointly parsing two languages has been shown to improve accuracies on either or both sides. However, its search space is much bigger than the monolingual case, forcing existing ap...
Liang Huang, Wenbin Jiang, Qun Liu
NIPS
2003
13 years 9 months ago
Online Learning via Global Feedback for Phrase Recognition
We present a system to recognize phrases based on perceptrons, and a global online learning algorithm to train them together. The recognition strategy applies learning in two laye...
Xavier Carreras, Lluís Màrquez
ICML
2009
IEEE
14 years 2 months ago
Online learning by ellipsoid method
In this work, we extend the ellipsoid method, which was originally designed for convex optimization, for online learning. The key idea is to approximate by an ellipsoid the classi...
Liu Yang, Rong Jin, Jieping Ye
IWINAC
2007
Springer
14 years 1 months ago
EDNA: Estimation of Dependency Networks Algorithm
One of the key points in Estimation of Distribution Algorithms (EDAs) is the learning of the probabilistic graphical model used to guide the search: the richer the model the more ...
José A. Gámez, Juan L. Mateo, Jose M...