Since the scoring function f (s) of our proposed summarizer is non-decreasing monotone submodular, we thus use the following greedy algorithm to obtain the near optimal solution.
abstractive summarization is a way of natural language generation and using this approach, it is possible to produce human-like summaries (Rush et al., 2015;Chopra et al., 2016;Wang and Ling, 2016).