Extractive Summarization: Limits, Compression, Generalized Model and HeuristicsResearch supported in part by NSF grants DUE 1241772, CNS 1319212 and DGE 1433817
Table 6: F1 scores on 100 word summaries for DUC 2002 documents
['[BOLD] Algorithm', '[BOLD] ROUGE-1', '[BOLD] ROUGE-2', '[BOLD] ROUGE-LCS']
Unfortunately, the authors did not report the Rouge bigram (ROUGE-2) and Rouge LCS Hence their results are not comparable to ours. In addition KKV did not report ROUGE-LCS scores. We observe that for Rouge unigram (ROUGE-1) F1-scores the dynamic optimal algorithm performs the best amongst the algorithms of DocSumm. However, it still falls behind the Baseline. When we consider Rouge bigram (ROUGE-2) F1-scores The margin of out-performance is even more pronounced in ROUGE-LCS F1-scores.