@InProceedings{Debusmann:2001,
AUTHOR = {Debusmann, Ralph},
TITLE = {Topological Dependency Trees: A Constraint-based Account of Linear Precedence},
YEAR = {2001},
BOOKTITLE = {Proceedings of the 39th Annual Meeting of the Association for Computational Linguistics (ACL 2001), July 9-11},
PAGES = {180-187},
ADDRESS = {Toulouse, France},
PUBLISHER = {Morgan Kaufmann Publishers},
URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/rade-acl2001.ps.gz},
ABSTRACT = {Linear precedence in so-called free word order languages remains challenging for modern grammar formalisms. To address this issue, we describe a new framework for dependency grammar, with a modular decomposition of immediate dependency and linear precedence. Our approach distinguishes two orthogonal yet mutually constraining structures: a syntactic dependency tree (ID tree) and a topological dependency tree (LP tree). The ID tree is non-projective, and even non-ordered, and its edges are labeled by syntactic roles. The LP tree is projective, partially ordered, and its edges are labeled by topological fields. The shape of the LP tree is a flattening of the ID tree's obtained by allowing nodes to 'climb up'. Our theory of ID/LP trees is formulated in terms of (a) lexicalized constraints and (b) principles governing e.g. climbing conditions. We illustrate it with a detailed account of word order phenomena in the verbal complex of German verb final sentences.},
ANNOTE = {COLIURL : Debusmann:2001:TDT.pdf Debusmann:2001:TDT.ps}
}
|
