@inproceedings{33a9de092331430693c42eae2b3c5614,
title = "Mining the Gaps: Towards Polynomial Summarization",
abstract = "The problem of text summarization for a collection of documents is defined as the problem of selecting a small subset of sentences so that the contents and meaning of the original document set are preserved in the best possible way. In this paper we present a linear model for the problem of text summarization1, where a summary preserves the information coverage as much as possible in comparison to the original document set. We reduce the problem of finding the best summary to the problem of finding the point on a convex polytope closest to the given hyperplane, and solve it efficiently with the help of fractional (polynomial-time) linear programming. The experimental results show the superiority of our approach over most of the systems participating in the generic multi-document summarization task (MultiLing) of the TAC 2011 competition.",
author = "Marina Litvak and Natalia Vanetik",
note = "Publisher Copyright: {\textcopyright} IJCNLP 2013.All right reserved.; 6th International Joint Conference on Natural Language Processing, IJCNLP 2013 ; Conference date: 14-10-2013",
year = "2013",
month = jan,
day = "1",
language = "English",
series = "6th International Joint Conference on Natural Language Processing, IJCNLP 2013 - Proceedings of the Main Conference",
publisher = "Asian Federation of Natural Language Processing",
pages = "655--660",
editor = "Ruslan Mitkov and Park, {Jong C.}",
booktitle = "6th International Joint Conference on Natural Language Processing, IJCNLP 2013 - Proceedings of the Main Conference",
}