Sciweavers

22 search results - page 1 / 5
» Efficient Third-Order Dependency Parsers
Sort
View
ACL
2010
13 years 9 months ago
Efficient Third-Order Dependency Parsers
We present algorithms for higher-order dependency parsing that are "third-order" in the sense that they can evaluate substructures containing three dependencies, and &qu...
Terry Koo, Michael Collins
AAAI
2007
14 years 1 months ago
Ungreedy Methods for Chinese Deterministic Dependency Parsing
Deterministic dependency parsing has often been regarded as an efficient parsing algorithm while its parsing accuracy is a little lower than the best results reported by more comp...
Xiangyu Duan, Jun Zhao, Bo Xu
ACL
2010
13 years 9 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
ACL
2010
13 years 9 months ago
A Transition-Based Parser for 2-Planar Dependency Structures
Finding a class of structures that is rich enough for adequate linguistic representation yet restricted enough for efficient computational processing is an important problem for d...
Carlos Gómez-Rodríguez, Joakim Nivre
ACL
2008
14 years 10 days ago
Semi-Supervised Convex Training for Dependency Parsing
We present a novel semi-supervised training algorithm for learning dependency parsers. By combining a supervised large margin loss with an unsupervised least squares loss, a discr...
Qin Iris Wang, Dale Schuurmans, Dekang Lin