Efficient processing of underspecified discourse representations

Authors:
Michaela Regneri;Markus Egg;Alexander Koller
Affiliations:
Saarland University;University of Groningen;University of Edinburgh
Venue:
HLT-Short '08 Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers
Year:
2008

Citing 6
Cited 1

Robust discourse parsing via discourse markers, topicality and position

Natural Language Engineering
An efficient graph algorithm for dominance constraints

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Efficient solving and exploration of scope ambiguities

ACLdemo '05 Proceedings of the ACL 2005 on Interactive poster and demonstration sessions
The Potsdam commentary corpus

DiscAnnotation '04 Proceedings of the 2004 ACL Workshop on Discourse Annotation
The evolution of dominance constraint solvers

Software '05 Proceedings of the Workshop on Software
An overview of probabilistic tree transducers for natural language processing

CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing

Improving the quality of text understanding by delaying ambiguity resolution

COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.