An algorithm for efficiently generating summary paragraphs using tree-adjoining grammar

Authors:
Bruce Eddy;Diana Bental;Alison Cawsey
Affiliations:
Heriot-Watt University, Edinburgh, UK;Heriot-Watt University, Edinburgh, UK;Heriot-Watt University, Edinburgh, UK
Venue:
EWNLG '01 Proceedings of the 8th European workshop on Natural Language Generation - Volume 8
Year:
2001

Citing 3
Cited 0

Empirically designing and evaluating a new revision-based model for summary generation

Artificial Intelligence - Special volume on empirical methods
Expressibility and the Problem of Efficient Text Planning

Expressibility and the Problem of Efficient Text Planning
Sentence planning as description using tree adjoining grammar

ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an algorithm which improves the efficiency of a search for the optimally aggregated paragraph which summarises a flat structured input specification. We model the space of possible paraphrases of possible paragraphs as the space of sequences of compositions of a set of tree-adjoining grammar (TAG) elementary trees. Our algorithm transforms this to a set with equivalent paraphrasing power but better computational properties. Also, it identifies an explicit mapping between input propositions and their possible surface realisations.