Permanent URL to this publication: http://dx.doi.org/10.5167/uzh-24418
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.
|Item Type:||Conference or Workshop Item (Paper), refereed, original work|
|Communities & Collections:||06 Faculty of Arts > Institute of Computational Linguistics|
000 Computer science, knowledge & systems
|Event End Date:||2009|
|Deposited On:||24 Nov 2009 13:42|
|Last Modified:||09 Jul 2012 04:01|
Users (please log in): suggest update or correction for this item
Repository Staff Only: item control page