We use the fact that the sentence probability p(t) defined in (1) is monotone decreasing when we append new word w to the sentence tail.
once we have found K anagrams and their probabilities are larger than θ, we can omit unnecessary subsequent search steps if the current partial sentence t satisfies θ > p(t).