Topological dependency trees: a constraint-based account of linear precedence

Authors:
Denys Duchier;Ralph Debusmann
Affiliations:
Universität des Saarlandes, Saarbrücken, Germany;Universität des Saarlandes, Saarbrücken, Germany
Venue:
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Year:
2001

Citing 1
Cited 28

Pseudo-projectivity: a polynomially parsable non-projective dependency grammar

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1

Parsing Ill-Formed Inputs with Constraint Graphs

CICLing '02 Proceedings of the Third International Conference on Computational Linguistics and Intelligent Text Processing
Put My Galakmid Coin into the Dispenser and Kick It: Computational Linguistics and Theorem Proving in a Computer Game

Journal of Logic, Language and Information
Information structure in topological dependency grammar

EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
From shallow to deep parsing using constraint satisfaction

COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Natural language and inference in a computer game

COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Linking syntactic and semantic arguments in a dependency-based formalism

COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Word order in German: a formal dependency grammar using a topological hierarchy

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Generation as dependency parsing

ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Integrated shallow and deep parsing: TopP meets HPSG

ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Pseudo-projective dependency parsing

ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
A polynomial parsing algorithm for the topological model: synchronizing constituent and dependency grammars, illustrated by German word order phenomena

ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
A relational syntax-semantics interface based on dependency grammar

COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Degrees of non-monotonicity for restarting automata

Theoretical Computer Science
Mildly non-projective dependency structures

COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions
Multiword expressions as dependency subgraphs

MWE '04 Proceedings of the Workshop on Multiword Expressions: Integrating Processing
Broad coverage multilingual deep sentence generation with a stochastic multi-level realizer

COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Informed ways of improving data-driven dependency parsing for German

COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics: Posters
A graph grammar approach to map between dependency trees and topological models

IJCNLP'04 Proceedings of the First international joint conference on Natural Language Processing
A modular account of information structure in extensible dependency grammar

CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing
Reconciling parameterization, configurability and optimality in natural language generation via multiparadigm programming

CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing
The XDG grammar development kit

MOZ'04 Proceedings of the Second international conference on Multiparadigm Programming in Mozart/Oz
Problems of inducing large coverage constraint-based dependency grammar for czech

CSLP'04 Proceedings of the First international conference on Constraint Solving and Language Processing
Multi-dimensional graph configuration for natural language processing

CSLP'04 Proceedings of the First international conference on Constraint Solving and Language Processing
An intuitive tool for constraint based grammars

CSLP'04 Proceedings of the First international conference on Constraint Solving and Language Processing
Dependency structure grammars

LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Iterated dependencies and Kleene iteration

FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
Generating non-projective word order in statistical linearization

EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
Knowledge sources for constituent parsing of german, a morphologically rich and less-configurational language

Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a new framework for dependency grammar, with a modular decomposition of immediate dependency and linear precedence. Our approach distinguishes two orthogonal yet mutually constraining structures: a syntactic dependency tree and a topological dependency tree. The syntax tree is nonprojective and even non-ordered, while the topological tree is projective and partially ordered.