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. © 2012, American College of Rheumatology.
Cite
CITATION STYLE
Regneri, M., Egg, M., & Koller, A. (2008). Efficient processing of underspecified discourse representations. In ACL-08: HLT - 46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, Proceedings of the Conference (pp. 245–248). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1557690.1557761
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
