Paper: Minimal Change And Bounded Incremental Parsing

ACL ID C94-1076
Title Minimal Change And Bounded Incremental Parsing
Venue International Conference on Computational Linguistics
Session Main Conference
Year 1994
Authors
  • Mats Wiren (Saarland University, Saarbrucken Germany)

Ideally, the time that an incremental algorithm uses to process a change should be a fimction of the size of the change rather than, say, the size of the entire current input.