Multi-Sentence Compression: Finding Shortest Paths in Word Graphs

In this blog, I have tried summarizing the paper Multi-Sentence Compression: Finding Shortest Paths in Word Graphs as per my understanding. Please feel free to comment your thoughts on the same! Sentence compression is the task of compressing a long sentence into a shorter one by deleting redundant words. This paper proposes a novel unsupervised multi-sentence compression technique wherein the goal is to represent a set of related sentences by a single sentence in such a way that it preserves the important parts of the main content and is also grammatically correct at the same time. One of the possible use cases for Sentence Compression (SC) is in Extractive Text Summarization, wherein a typical flow is to rank sentences based on a certain scoring strategy followed by selecting top-k sentences as representative summary.