Fast Joint Compression and Summarization via Graph Cuts
Xian Qian, Yang Liu · 2013
Extractive summarization typically uses sentences as summarization units.In contrast, joint compression and summarization can use smaller units such as words and phrases, resulting in summaries containing more information.The goal of compressive summarization is to find a subset of words that maximize the total score of concepts and cutting dependency arcs under the grammar constraints and summary length constraint.We propose an efficient decoding algorithm for fast compressive summarization using graph cuts.Our approach first relaxes the length constraint using Lagrangian relaxation.Then we propose to bound the relaxed objective function by the supermodular binary quadratic programming problem, which can be solved efficiently using graph max-flow/min-cut.Since finding the tightest lower bound suffers from local optimality, we use convex relaxation for initialization.Experimental results on TAC2008 dataset demonstrate our method achieves competitive ROUGE score and has good readability, while is much faster than the integer linear programming (ILP) method.