Bounded Incremental Parsing

Ideally, the time that an incremental algorithm uses to process a change should be a function of the size of \the set of things changed" rather than the size of the entire current input. Building upon a previous notion of change, this paper investigates how and to what extent it is possible to give such a guarantee for a chart-based parsing framework. Two results are provided: rst, it is shown that a previously proposed algorithm is unbounded incremental; secondly, it is outlined how a polynomial time bound can be obtained by reening this algorithm.