In the popular cube pruning algorithm, every hypothesis is annotated with boundary words and permitted to recombine only if all boundary words are equal.
many hypotheses share some, but not all, boundary words.