A Formalism for Dependency Grammar Based on Tree Adjoining Grammar
Aravind K. Joshi, Owen Rambow · 2003
In this paper, we present a formalism for dependency grammar based on some key ideas from Tree-Adjoining Grammars. We represent a dependency grammar in terms of elementary dependency trees anchored on lexical items. These elementary trees correctly capture the dependencies associated with the lexical anchor. These trees may also include nodes that represent items on which the lexical anchor depends. These nodes are well motivated. We also describe operations that combine elementary or derived dependency trees, which are analogous to “substitution” and ”adjoining” in TAG. This characterization of a dependency grammar allows one to transfer all the key insights from TAG to dependency grammars.