Minimal Change and Bounded Incremental Parsing

Details Minimal Change and Bounded Incremental Parsing Minimal Change and Bounded Incremental Parsing

1994-10-25

arxiv.org/abs/cmp-lg/9410028v1

Computer Science

Computation and Language

7 pages, compressed and uuencoded

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Minimal Change and Bounded Incremental Parsing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Minimal Change and Bounded Incremental Parsing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimal Change and Bounded Incremental Parsing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-314501