The information-processing difficulty of incremental parsing

Authors:
John Hale
Affiliations:
Michigan State University, East Lansing, MI
Venue:
IncrementParsing '04 Proceedings of the Workshop on Incremental Parsing: Bringing Engineering and Cognition Together
Year:
2004

Citing 8
Cited 0

On multiple context-free grammars

Theoretical Computer Science
Structural similarity within and among languages

Theoretical Computer Science - Algebraic methods in language processing
Derivational Minimalism

LACL '96 Selected papers from the First International Conference on Logical Aspects of Computational Linguistics
Deterministic Techniques for Efficient Non-Deterministic Parsers

Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Statistical properties of probabilistic context-free grammars

Computational Linguistics
The structure of shared forests in ambiguous parsing

ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Parsing incomplete sentences

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Grammar, uncertainty and sentence processing

Grammar, uncertainty and sentence processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

When an incremental parser gets the next word, its expectations about upcoming grammatical structures can change. When a word greatly constrains these grammatical expectations, uncertainty is reduced. This elimination of possibilities constitutes information processing work. Formalizing this notion of information processing work yields a complexity metric that predicts human repetition accuracy scores across a systematic class of linguistic phenomena, the Accessibility Hierarchy of relativizable grammatical relations.