Sciweavers

COLING
2010

Multi-Sentence Compression: Finding Shortest Paths in Word Graphs

12 years 10 months ago
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.
Katja Filippova
Added 13 May 2011
Updated 13 May 2011
Type Journal
Year 2010
Where COLING
Authors Katja Filippova
Comments (0)