Information Structure in Topological Dependency Grammar
نویسندگان
چکیده
Topological Dependency Grammar (TDG) is a lexicalized dependency grammar formalism, able to model languages with a relatively free word order. In such languages, word order variation often has an important function: the realization of information structure. The paper discusses how to integrate information structure into TDG, and presents a constraint-based approach to modelling information structure and the various means to realize it, focusing on (possibly simultaneous use of) word order and tune.
منابع مشابه
Tree Unification Grammar Problems and Proposals for Topology , TAG , and
This work presents a lexicalized grammar formalism which can be seen as a variant of multi-component tree adjoining grammar (TAG). This formalism is well-suited for describing the syntax of German because it relates a syntactic dependency graph with a hierarchy of topological domains. The topological phrase structure encodes the placement of verbal and nominal elements in the (ordered) field st...
متن کاملWord Order in German: A Formal Dependency Grammar Using a Topological Hierarchy
This paper proposes a description of German word order including phenomena considered as complex, such as scrambling, (partial) VP fronting and verbal pied piping. Our description relates a syntactic dependency structure directly to a topological hierarchy without resorting to movement or similar mechanisms.
متن کاملCG-3 - Beyond Classical Constraint Grammar
This paper discusses methodological strengths and shortcomings of the Constraint Grammar paradigm (CG), showing how the classical CG formalism can be extended to achieve greater expressive power and how it can be enhanced and hybridized with techniques from other parsing paradigms. We present a new, largely theoryindependent CG framework and rule compiler (CG3), that allows the linguist to wr...
متن کاملWord Order in German: A Formal Dependency Grammar Using a Topological Hierarchy
This paper proposes a description of German word order including phenomena considered as complex, such as scrambling, (partial) VP fronting and verbal pied piping. Our description relates a syntactic dependency structure directly to a topological hierarchy without resorting to movement or similar mechanisms.
متن کاملA polynomial parsing algorithm for the topological model Synchronizing Constituent and Dependency Grammars, Illustrated by German Word Order Phenomena
This paper describes a minimal topology driven parsing algorithm for topological grammars that synchronizes a rewriting grammar and a dependency grammar, obtaining two linguistically motivated syntactic structures. The use of non-local slash and visitor features can be restricted to obtain a CKY type analysis in polynomial time. German long distance phenomena illustrate the algorithm, bringing ...
متن کامل