simhash like algorithm to compare two text documents

The problem is: I have a collection of text documents, i want to pick up the most similar one to the input one. The input text document could be exactly match or modified par开发者_如何转开发tly. The algorithm must be very fast.

Currently, I found simhash to take a fingerprint from collection documents. Is there any other algorithm to do the same thing?

---

LSH (Locality Sensitive Hashing) techniques are general indexing methods. They are very efficient at finding approximate nearest neighbors.

SimHash is one hashing algorithm for LSH. It uses cosine similarity over real-valued data.

MinHash is another hashing algorithm for LSH. It calculates resemblance similarity over binary vectors.

Mining of Massive Dataset, Chapter 3 by Anand Rajaraman and Jeff Ullman. is good introduction to the problem space and MinHash in particular.

---

have you tried LSH(locality sensitive Hashing) techniques