3 We test the naive LSH-based partitioning (LSH-only)  Reference  4029 3h 12m 32s  1847 24m 21s 10131 22h 48m 08s   LSH-only  3694  1s  1752  1s  7827  2s  LSH-CW  4085  23s  1875  11s  9861  58s   Table 1: Concept mention grouping runtimes on average and for the smallest and largest set.
since comparing neighbors in a sorted list of bit hashes will primarily find those that differ in the last positions, the random permutations are the key part of the algorithm that ensures similar hashes differing at varying positions are found.