Recently, summarization has also been considered as a submodular function maximization (Lin andBilmes, 2010, 2011;Dasgupta et al., 2013) where greedy algorithms were adopted to achieve near optimal summaries.
the main drawback of all the extractive approaches is that they can not avoid the inclusion of insignificant information which degrades the summary quality.