From: Thomas Hurst <tom.hurst@...>
Date: 2002-06-07T01:42:07+09:00
Subject: Re: Hashes sensitive to simularity

* Ned Konz (ned@bike-nomad.com) wrote:

> Perhaps Levenshtein distance?
> http://www.merriampark.com/ld.htm

Mmmn, the thing is, I really need a key I can use for a database and a
hash.  Maybe something like an overlong soundex, or a more generic
hashing algorithm that produces identical hashes up to a certain
threshold.

I suppose I might be able to use a less accurate algorithm and use
a simularity matching algorithm like Levenshtein distance on the smaller
set.

-- 
Thomas 'Freaky' Hurst  -  freaky@aagh.net  -  http://www.aagh.net/
-
QOTD:
	"You're so dumb you don't even have wisdom teeth."