Multi-Sentence Compression: Finding Shortest Paths in Word Graphs

@inproceedings{Filippova2010MultiSentenceCF,
  title={Multi-Sentence Compression: Finding Shortest Paths in Word Graphs},
  author={Katja Filippova},
  booktitle={COLING},
  year={2010}
}
We consider the task of summarizing a cluster of related sentences with a short sentence which we call multi-sentence compressionand 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. 
Highly Influential
This paper has highly influenced 27 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 150 citations. REVIEW CITATIONS

3 Figures & Tables

Topics

Statistics

020402009201020112012201320142015201620172018
Citations per Year

151 Citations

Semantic Scholar estimates that this publication has 151 citations based on the available data.

See our FAQ for additional information.