22 search results - page 1 / 5 » Efficient Third-Order Dependency Parsers |
71
Voted
ACL
2010
14 years 7 months ago
2010
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...
AAAI
2007
14 years 12 months ago
2007
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...
ACL
2010
14 years 7 months ago
2010
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 ...
70
Voted
ACL
2010
14 years 7 months ago
2010
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...
94
Voted
ACL
2008
14 years 11 months ago
2008
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...