Multi-Sentence Compression: Finding Shortest Paths in Word Graphs

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 approach based on shortest paths in word graphs. The advantage and the novelty of the proposed method is that it is syntaxlean and requires little more than a tokenizer and a tagger. Despite its simplicity, it is capable of generating grammatical and informative summaries as our experiments with English and Spanish data demonstrate.

• Type: Journal
• Year: 2010
• Where: COLING
• Authors: Katja Filippova
• Keywords: COLING 2010, Computational Linguistics, Short Sentence, Shortest Paths, Word Graphs