Extractive Summarization: Limits, Compression, Generalized Model and HeuristicsResearch supported in part by NSF grants DUE 1241772, CNS 1319212 and DGE 1433817
Table 5: Running Times of algorithms in milliseconds.
['[BOLD] verse count', '[BOLD] greedy size', '[BOLD] greedy size+d', '[BOLD] greedy tfidf', '[BOLD] bottom- up']
Run times The dataset for running times is created by sampling sentences from the book of Genesis. We created documents of increasing lengths, where length is measured in verses. The verse count ranged from 4 to 320. However, for documents greater than 20 sentences, the top-down dynamic algorithm runs out of memory. So there are no results on the top-down exhaustive algorithm. For both tfidf and bottom-up there is a significant increase in running time.