Thirdly, the number of reordering permutations or paths are formidable when the reordering distance L is long as suggested by Table 1.
we apply histogram pruning to reordering paths, which only maintains top N most likely ones.