Name: hasher 2009-06-22 12:14
Hello, I need an hashing algorithm which outputs a hash which doesn't change much if the output doesn't change much.
Ideally if I had string1 which were quite similar to string2, the two hashes should differ by something comparable to the Levenshtein distance.
That's not really important though.
I thought about an homothetic transformation (that is taking each nth character in order to end up with a constant length string), but I don't really know.
Any suggestions?
Ideally if I had string1 which were quite similar to string2, the two hashes should differ by something comparable to the Levenshtein distance.
That's not really important though.
I thought about an homothetic transformation (that is taking each nth character in order to end up with a constant length string), but I don't really know.
Any suggestions?