Summary Level Training of Sentence Rewriting for Abstractive Summarization
Table 3: Comparison of different methods building upper bound for full model.
['[EMPTY]', '[BOLD] R-1', '[BOLD] R-2', '[BOLD] R-L']
We see considerable gaps between Sentence-matching and Greedy Search, while the scores of Greedy Search are close to those of Combination Search. Note that since we limited the number of sentences for Combination Search, the exact scores for it would be higher. The scores can be interpreted to be upper bounds for corresponding training methods. This result supports our training strategy; pre-training with Greedy Search and final optimization with the combinatorial return.