We therefore investigate approximated k-NN query methods which sacrifice some accuracy for a large gain in speed.
we look into locality sensitive hashing (LSH; §4.1), a popular method, as well as redundant bit vectors (RBV; §4.2), which to our knowledge has not been previously used for natural language processing tasks.