Abstract

Deterministic dependency parsing is a robust and efficient approach to syntactic parsing of unrestricted natural language text. In this paper, we analyze its potential for incremental processing and conclude that strict incrementality is not achievable within this framework. However, we also show that it is possible to minimize the number of structures that require nonincremental processing by choosing an optimal parsing algorithm. This claim is substantiated with experimental evidence showing that the algorithm achieves incremental parsing for 68.9% of the input when tested on a random sample of Swedish text. When restricted to sentences that are accepted by the parser, the degree of incrementality increases to 87.9%. 1

Citations

671	A Maximum-Entropy-Inspired Parser - Charniak - 2000
427	Three Generative, Lexicalised Models for Statistical Parsing - Collins - 1997
396	The syntactic process - Steedman - 2000
296	Dependency Syntax: Theory and Practice - Melcuk - 1988
291	Parsing by chunks - Abney - 1991
240	Timbl: Tilburg memory based learner, version 3.0, reference guide - Daelemans, Zavrel, et al. - 2000
121	Finitary models of language users - Miller, Chomsky - 1963
66	Memory-Based Shallow Parsing - Daelemans, Buchholz, et al. - 1999
46	Linguistic Structure & Speech Shadowing at Very Short Latencies’, Nature 244 - Marslen-Wilson - 1973
43	Memory Requirements and Local Ambiguities of Parsing Strategies - Abney, Johnson - 1991
32	Syntactic processing: Evidence from Dutch - Frazier - 1987
16	Talbankens skriftspråkskonkordans - Einarsson - 1976