It has been shown before in (Kulik et al., 2009) that if f is a submodular, nondecreasing set function and f (∅) = 0, then such a greedy algorithm finds a set S, whose gain is at least as high as (1 − 1/e) of the best possible solution.
we can optimize the keyphrase coverage as described in Algorithm 1.