That is, we wish to find a small set of sentences that would lead to the greatest reduction of currently unknown words Finding these sentences is a NP-hard problem because the 0/1 knapsack problem could be reduced to this problem in polynomial-time (Gurari, 1989).
we developed an approximation algorithm for finding sentences with the maximum word M : number of tokens will be annotated.