26 search results - page 3 / 6 » Improving Dependency Parsing with Subtrees from Auto-Parsed ... |
TAL
2010
Springer
13 years 5 months ago
2010
Springer
This paper shows how the best data-driven dependency parsers available today [1] can be improved by learning from unlabeled data. We focus on German and Swedish and show that label...
JMLR
2010
13 years 6 months ago
2010
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
ACL
2007
13 years 9 months ago
2007
In this paper we present methods for improving the disambiguation of noun phrase (NP) coordination within the framework of a lexicalised history-based parsing model. As well as re...
EMNLP
2007
13 years 9 months ago
2007
One may need to build a statistical parser for a new language, using only a very small labeled treebank together with raw text. We argue that bootstrapping a parser is most promis...
ACL
2009
13 years 5 months ago
2009
We formulate the problem of nonprojective dependency parsing as a polynomial-sized integer linear program. Our formulation is able to handle non-local output features in an effici...