pith. sign in

arxiv: cmp-lg/9808009 · v1 · submitted 1998-08-21 · cmp-lg · cs.CL

How to define a context-free backbone for DGs: Implementing a DG in the LFG formalism

classification cmp-lg cs.CL
keywords dependencytreegrammarorderwordanalysisapproachattention
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.