Efficient Processing of Underspecified Discourse Representations

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

• Type: Conference
• Year: 2008
• Where: ACL
• Authors: Michaela Regneri, Markus Egg, Alexander Koller
• Keywords: ACL 2008, Computational Linguistics, Disambiguated Discourse Structure, Discourse, RST Discourse Treebank