18 search results - page 2 / 4 » An Efficient Algorithm for Easy-First Non-Directional Depend... |
ECML
2006
Springer
13 years 8 months ago
2006
Springer
In this paper, we provide a study on the use of tree kernels to encode syntactic parsing information in natural language learning. In particular, we propose a new convolution kerne...
ACL
2010
13 years 2 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 ...
ACL
2008
13 years 6 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...
ACL
2001
13 years 6 months ago
2001
Polarized dependency (PD-) grammars are proposed as a means of efficient treatment of discontinuous constructions. PD-grammars describe two kinds of dependencies : local, explicit...
AI
2009
Springer
13 years 8 months ago
2009
Springer
Abstract. A top-down parsing algorithm has been constructed to accommodate any form of ambiguous context-free grammar, augmented with semantic rules with arbitrary attribute depend...