In other words, bursty incomplete N-grams inevitably overlap bursty phrases.
the proposed method performs the extraction of bursty phrases as the set cover problem in which all bursty N-grams are covered by a minimum set of bursty phrases.