How to define a context-free backbone for DGs: Implementing a DG in the LFG formalism
cmp-lg
2009-09-25 v1 Computation and Language
Abstract
This paper presents a multidimensional Dependency Grammar (DG), which decouples the dependency tree from word order, such that surface ordering is not determined by traversing the dependency tree. We develop the notion of a \emph{word order domain structure}, which is linked but structurally dissimilar to the syntactic dependency tree. We then discuss the implementation of such a DG using constructs from a unification-based phrase-structure approach, namely Lexical-Functional Grammar (LFG). Particular attention is given to the analysis of discontinuities in DG in terms of LFG's functional uncertainty.
Keywords
Cite
@article{arxiv.cmp-lg/9808009,
title = {How to define a context-free backbone for DGs: Implementing a DG in the LFG formalism},
author = {Norbert Broeker},
journal= {arXiv preprint arXiv:cmp-lg/9808009},
year = {2009}
}
Comments
10 pages, LaTeX2e