ML p(r)ior | Minimal Change and Bounded Incremental Parsing
Processing...

Minimal Change and Bounded Incremental Parsing

1994-10-25
9410028 | cmp-lg
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.
PDF

Login to like/save this paper, take notes and configure your recommendations