Sciweavers

22 search results - page 3 / 5
» Efficient Third-Order Dependency Parsers
Sort
View
COLING
1996
13 years 6 months ago
Modularizing Codescriptive Grammars for Efficient Parsing
Unification-based theories of grammar allow to integrate different levels of linguistic descriptions in the common framework of typed feature structures. Dependencies among the le...
Walter Kasper, Hans-Ulrich Krieger
ACL
2010
13 years 3 months ago
A Probabilistic Generative Model for an Intermediate Constituency-Dependency Representation
We present a probabilistic model extension to the Tesni`ere Dependency Structure (TDS) framework formulated in (Sangati and Mazza, 2009). This representation incorporates aspects ...
Federico Sangati
ACL
2009
13 years 3 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...
CORR
2000
Springer
110views Education» more  CORR 2000»
13 years 5 months ago
Efficient probabilistic top-down and left-corner parsing
This paper examines efficient predictive broadcoverage parsing without dynamic programming. In contrast to bottom-up methods, depth-first top-down parsing produces partial parses ...
Brian Roark, Mark Johnson
EACL
2006
ACL Anthology
13 years 6 months ago
Constraints on Non-Projective Dependency Parsing
We investigate a series of graph-theoretic constraints on non-projective dependency parsing and their effect on expressivity, i.e. whether they allow naturally occurring syntactic...
Joakim Nivre