Extractive multi-document summarization based on textual entailment and sentence compression via knapsack problem. (31st October 2018)

• Record Type: Journal Article
• Authors: NASERASADI, ALI; KHOSRAVI, HAMID; SADEGHI, FARAMARZ
• Is Part Of: Natural language engineering. Volume 25:Part 1(2019)
• Page Start: 121
• Page End: 146
• Publication Date: 2018-10-31
• Subjects: Natural language processing (Computer science) -- Periodicals; Software engineering -- Periodicals; 006.35
• DOI: 10.1017/S1351324918000414
• Languages: English
• ISSNs: 1351-3249

Abstract

Abstract: By increasing the amount of data in computer networks, searching and finding suitable information will be harder for users. One of the most widespread forms of information on such networks are textual documents. So exploring these documents to get information about their content is difficult and sometimes impossible. Multi-document text summarization systems are an aid to producing a summary with a fixed and predefined length, while covering the maximum content of the input documents. This paper presents a novel method for multi-document extractive summarization based on textual entailment relations and sentence compression via formulating the problem as a knapsack problem. In this approach, sentences of documents are ranked according to the extended Tf-Idf method, then entailment scores of selected sentences are computed. Through these scores, the final score of each sentence is calculated. Finally, by decreasing the lengths of sentences via sentence compression, the problem has been solved by greedy and dynamic Programming approaches to the knapsack problem. Experiments on standard summarization datasets and evaluating the results based on the Rouge system show that the suggested method, according to the best of our knowledge, has increased F-measure of query-based summarization systems by two per cent and F-measure of general summarization systems by five per cent.