Specifically, these argument candidates often overlap and differ only in one or two words.
the pruning heuristic based on full parsing never outputs overlapping candidates and consequently provides input that is easier for the next stage to handle.