In our case, I is the set of words that occur at least t times in the unlabelled pool, b i = t, ∀i ∈ I, the multisets are the sentences in that pool and w j = 1, ∀j ∈ J. Multiset multicover is NP-hard.
there is a good greedy approximation algorithm for it.