Sciweavers

Share
EMNLP
2007

A Constraint Satisfaction Approach to Dependency Parsing

9 years 2 months ago
A Constraint Satisfaction Approach to Dependency Parsing
We present an adaptation of constraint satisfaction inference (Canisius et al., 2006b) for predicting dependency trees. Three different classifiers are trained to predict weighted soft-constraints on parts of the complex output. From these constraints, a standard weighted constraint satisfaction problem can be formed, the solution to which is a valid dependency tree.
Sander Canisius, Erik Tjong Kim Sang
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2007
Where EMNLP
Authors Sander Canisius, Erik Tjong Kim Sang
Comments (0)
books