Minimal Change and Bounded Incremental Parsing
| dc.creator | Wirén, Mats | |
| dc.date | 1994-10-25 | |
| dc.date.accessioned | 2026-07-07T09:09:36Z | |
| dc.date.available | 2026-07-07T09:09:36Z | |
| dc.description | 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. | |
| dc.description | 7 pages, compressed and uuencoded | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9410028 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9410028 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151093 | |
| dc.subject | Computation and Language | |
| dc.title | Minimal Change and Bounded Incremental Parsing | |
| dc.type | text |