A framework for constituent-dependency conversion
Torsten Marek, Gerold Schneider, Martin Volk · Zurich Open Repository and Archive (University of Zurich) · 2009
In this paper, we present a declarative formalism for writing rule sets to convert constituent trees into dependency graphs. The formalism is designed to be independent of the annotation scheme and provides a highly task-related syntax, abstracting away from the underlying graph data structures. We have implemented the formalism in our search tool and used a preliminary version to create a rule set that converts more than 97% of the TIGER corpus.