Paper: Efficient Processing of Underspecified Discourse Representations

ACL ID P08-2062
Title Efficient Processing of Underspecified Discourse Representations
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 2008
Authors
  • Michaela Regneri (University of Groningen, Groningen The Netherlands; Saarland University, Saarbrucken Germany)
  • Markus Egg (University of Groningen, Groningen The Netherlands)
  • Alexander Koller (University of Edinburgh, Edinburgh UK)

Underspecification-based algorithms for pro- cessing partially disambiguated discourse structure must cope with extremely high num- bers of readings. Based on previous work on dominance graphs and weighted tree gram- mars, we provide the first possibility for com- puting an underspecified discourse description and a best discourse representation efficiently enough to process even the longest discourses in the RST Discourse Treebank.