Our method is faster than existing compressive summarization methods since it employs the efficient greedy algorithm.
given a set, V , of all textual units contained in the document data and a summary length limitation value, L, our method requires at most O(L|V |) objective function evaluations.