A fast retrieval of those colliding phrases can be done via a hash table.
since the projection is random, it is very likely that true neighbors in the d-dimensional space fall into different bins after projection (false negatives; e.g., p 1 and p 4 in Figure 3 (a)).