This set of words is then iteratively reduced, using the admissible suffix candidates (those below a certain length exceeding a heuristic threshold of overrepresentation) in each step, as long as at least two stem candidates remain.
: There must be at least two stems in the corpus appearing with all the suffix candidates.