Cross-serial dependencies are not hard to process

Authors:
Carl Vogel;Ulrike Hahn;Holly Branigan
Affiliations:
University of Stuttgart, Stuttgart, Germany;University of Oxford, Oxford, England;University of Edinburgh, Edinburgh, Scotland
Venue:
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Year:
1996

Citing 5
Cited 1

A formal model for context-free languages augmented with reduplication

Computational Linguistics
Indexed Grammars—An Extension of Context-Free Grammars

Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Treating coordination in logic grammars

Computational Linguistics
Dynamics, dependency grammar and incremental interpretation

COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 4

Incremental speech translation

Incremental speech translation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cross-serial dependencies in Dutch and Swiss-German are the only known extracontext free natural language syntactic phenomena. Psycholinguistic evidence suggests cross-serial orderings tend to be easier to process than nested constructions. We argue that the expressivity requirements of the corresponding formal languages do not actually entail that processing reduplication languages require the worst-case time complexity for languages of the same expressive class. We distinguish between context-free representability and context-free processing. We show that for any language with up to context free expressive power, processing cross-serial dependencies can be accommodated without affecting parsing complexity. This is related to other work on reduplication phenomena in formal models of computation.