Computer Science – Computation and Language
Scientific paper
1998-08-21
Proc. COLING-ACL'98 Workshop ``Processing of Dependency-Based Grammars'', pp 29-38
Computer Science
Computation and Language
10 pages, LaTeX2e
Scientific paper
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.
No associations
LandOfFree
How to define a context-free backbone for DGs: Implementing a DG in the LFG formalism does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with How to define a context-free backbone for DGs: Implementing a DG in the LFG formalism, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and How to define a context-free backbone for DGs: Implementing a DG in the LFG formalism will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-21276