Speaker
Affilliation
Corunna, Spain
Abstract
I will define a new formalism, based on Sikkel's parsing schemata for constituency parsers, that can be used to describe, analyze and compare dependency parsing algorithms. This abstraction allows us to establish clear relations between several existing projective dependency parsers, explore their formal properties and automatically derive efficient implementations for them.
[Practice talk for ACL 2008]