Abstract | ||
---|---|---|
This paper derives an Integer Linear Programming (ILP) formulation to obtain an oracle summary of the compressive summarization paradigm in terms of ROUGE. The oracle summary is essential to reveal the upper bound performance of the paradigm. Experimental results on the DUC dataset showed that ROUGE scores of compressive oracles are significantly higher than those of extractive oracles and state-of-the-art summarization systems. These results reveal that compressive summarization is a promising paradigm and encourage us to continue with the research to produce informative summaries. |
Year | DOI | Venue |
---|---|---|
2017 | 10.18653/v1/P17-2043 | PROCEEDINGS OF THE 55TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL 2017), VOL 2 |
Field | DocType | Volume |
Automatic summarization,Computer science,Oracle,Natural language processing,Artificial intelligence | Conference | P17-2 |
Citations | PageRank | References |
0 | 0.34 | 9 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Tsutomu Hirao | 1 | 18 | 4.14 |
Masaaki Nishino | 2 | 28 | 10.34 |
Masaaki Nagata | 3 | 19 | 5.41 |