Sciweavers

11 search results - page 1 / 3
» Towards an N-Version Dependency Parser
Sort
View
TSD
2010
Springer
13 years 3 months ago
Towards an N-Version Dependency Parser
Abstract. Maltparser is a contemporary dependency parsing machine learningbased system that shows great accuracy. However 90% for Labelled Attachment Score (LAS) seems to be a de f...
Miguel Ballesteros, Jesús Herrera, Virginia...
ACL
2009
13 years 2 months ago
Semi-supervised Learning of Dependency Parsers using Generalized Expectation Criteria
In this paper, we propose a novel method for semi-supervised learning of nonprojective log-linear dependency parsers using directly expressed linguistic prior knowledge (e.g. a no...
Gregory Druck, Gideon S. Mann, Andrew McCallum
ACL
2009
13 years 2 months ago
Concise Integer Linear Programming Formulations for Dependency Parsing
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...
André L. Martins, Noah A. Smith, Eric P. Xi...
ACL
1989
13 years 6 months ago
Acquiring Disambiguation Rules from Text
An effective procedure for automatically acquiring a new set of disambiguation rules for an existing deterministic parser on the basis of tagged text is presented. Performance of ...
Donald Hindle
CORR
1998
Springer
127views Education» more  CORR 1998»
13 years 4 months ago
Towards an implementable dependency grammar
Syntactic models should be descriptively adequate and parsable. A syntactic description is autonomous in the sense that it has certain explicitformal properties. Such a descriptio...
Timo Järvinen, Pasi Tapanainen