Minimal Change and Bounded Incremental Parsing
<|reference_start|>Minimal Change and Bounded Incremental Parsing: 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.<|reference_end|>
@article{wirén1994minimal,
    title={Minimal Change and Bounded Incremental Parsing},
    author={Mats Wir'en (Universitat des Saarlandes)},
    journal={arXiv preprint arXiv:cmp-lg/9410028},
    year={1994},
    archivePrefix={arXiv},
    eprint={cmp-lg/9410028},
    primaryClass={cmp-lg cs.CL}
}