Paper: Multi-Sentence Compression: Finding Shortest Paths in Word Graphs

ACL ID C10-1037
Title Multi-Sentence Compression: Finding Shortest Paths in Word Graphs
Venue International Conference on Computational Linguistics
Session Main Conference
Year 2010
Authors

We consider the task of summarizing a cluster of related sentences with a short sentence which we call multi-sentence compression and present a simple ap- proach based on shortest paths in word graphs. The advantage and the novelty of the proposed method is that it is syntax- lean and requires little more than a tok- enizer and a tagger. Despite its simplic- ity, it is capable of generating grammati- cal and informative summaries as our ex- periments with English and Spanish data demonstrate.