Sciweavers

168 search results - page 1 / 34
» Dynamic Programming Algorithms for Transition-Based Dependen...
Sort
View
59
Voted
ACL
2011
14 years 1 months ago
Dynamic Programming Algorithms for Transition-Based Dependency Parsers
Marco Kuhlmann, Carlos Gómez-Rodrígu...
ACL
2010
14 years 7 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
NAACL
2010
14 years 7 months ago
An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
Yoav Goldberg, Michael Elhadad
DAC
2003
ACM
15 years 10 months ago
Scalable modeling and optimization of mode transitions based on decoupled power management architecture
To save energy, many power management policies rely on issuing mode-change commands to the components of the system. Efforts to date have focused on how these policies interact wi...
Dexin Li, Qiang Xie, Pai H. Chou
EMNLP
2011
13 years 9 months ago
Training a Log-Linear Parser with Loss Functions via Softmax-Margin
Log-linear parsing models are often trained by optimizing likelihood, but we would prefer to optimise for a task-specific metric like Fmeasure. Softmax-margin is a convex objecti...
Michael Auli, Adam Lopez