Word order and discontinuities in dependency grammar

Authors:
C. Bartha;T. Spiegelhauer;R. Dormeyer;I. Fischer
Affiliations:
Siemens PSE Hungary, Szeged;Lehrstuhl für Informatik, Friedrich-Alexander Universität Erlangen-Nürnberg, Erlangen, Germany;Lehrstuhl für Informatik, Friedrich-Alexander Universität Erlangen-Nürnberg, Erlangen, Germany;Lehrstuhl für Informatik, Friedrich-Alexander Universität Erlangen-Nürnberg, Erlangen, Germany
Venue:
Acta Cybernetica
Year:
2006

Citing 5
Cited 0

Parsing discontinuous constituents in dependency grammar

Computational Linguistics
Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition

Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition
Slot Grammar: A System for Simpler Construction of Practical Natural Language Grammars

Proceedings of the International Symposium on Natural Language and Logic
Separating surface order and syntactic relations in a dependency grammar

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Chart parsing according to the slot and filler principle

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Natural languages are always difficult to parse. Two phenomena that constantly pose problems for different formalisms are word order--what part of a sentence has to be placed where--and discontinuities--words that belong together but are not placed into the same phrase. Dependency grammar, a linguistic formalism based on binary relations between words, is very adequate for handling both problems. A parser for dependency grammar together with its grammar writing formalism is described in this paper. Word order and discontinuities in Hungarian are handled based on this formalism.