.png){kind=icon}
返回
Summarizing a Document by Trimming the Discourse Tree
.png){kind=icon}
PRE
AI
DOI：10.1109/TASLP.2015.2465150.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Recent studies on extractive text summarization formulate it as a combinatorial optimization problem, extracting the optimal subset from a set of the textual units that maximizes an objective function without violating the length constraint. Although these methods successfully improve automatic evaluation scores, they do not consider the discourse structure in the source document. Thus, summaries generated by these methods may lack logical coherence. In previous work, we proposed a method that exploits a discourse tree structure to produce coherent summaries. By transforming a traditional discourse tree, namely a rhetorical structure theory-based discourse tree (RST-DT), into a dependency-based discourse tree (DEP-DT), we formulated the summarization procedure as a Tree Knapsack Problem whose tree corresponds to the DEP-DT. This paper extends the work with a detailed discussion of the approach together with a novel efficient dynamic programming algorithm for solving the Tree Knapsack Problem. Experiments show that our method not only achieved the highest score in both automatic and human evaluation, but also obtained good performance in terms of the linguistic qualities of the summaries.
Keyword:
Discourse analysis
single-document summarization
tree knapsack problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
5.1
论文数:
2.6K
被引数:
1.1W
机构
引用论文
China’s Internet lexicon: Symbolic meaning and commoditization of Grass Mud Horse in the harmonious society.png)
First Monday
First MondayIF0
PREAI
分享收藏Removal of toxic gas by hybrid chemical filter fabricated by the sequential adsorption of polymers
PREAI
分享收藏
查看更多内容