Minimal change and bounded incremental parsing

Authors:
Mats Wirén
Affiliations:
Universität des Saarlandes, Saarbrücken, Germany
Venue:
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Year:
1994

Citing 7
Cited 0

Computer interpretation of natural language descriptions

Computer interpretation of natural language descriptions
Bounded incremental computation

Bounded incremental computation
Incremental evaluation of computational circuits

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Incremental Parsing

ACM Transactions on Programming Languages and Systems (TOPLAS)
Introduction to Formal Language Theory

Introduction to Formal Language Theory
Optimal-time incremental semantic analysis for syntax-directed editors

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Interactive incremental chart parsing

EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ideally, the time that an incremental algorithm uses to process a change should be a function of the size of the change rather than, say, the size of the entire current input. Based on a formalization of "the set of things changed" by an incremental modification, this paper investigates how and to what extent it is possible to give such a guarantee for a chart-based parsing framework and discusses the general utility of a minimality notion in incremental processing.