This is a bigger_rerun branch used in the dissertation of Leonid Boytsov: "Efficient and Accurate Non-Metric k-NN Search with Applications to Text Matching". A summary of this work is given in the following blog post..

This project has been supported primarily by the NSF grant #1618159 : "Matching and Ranking via Proximity Graphs: Applications to Question Answering and Beyond".