for x,y in word1, word2 ?
timothy.grant at gmail.com
Mon Aug 11 20:08:13 CEST 2008
On Mon, Aug 11, 2008 at 8:44 AM, Casey <Caseyweb at gmail.com> wrote:
> My first thought is that you should be looking at implementations of
> Hamming Distance. If you are actually looking for something like
> SOUNDEX you might also want to look at the double metaphor algorithm,
> which is significantly harder to implement but provides better
> matching and is less susceptible to differences based on name origins.
I responded in the thread of the poster's original message on this
subject, but will do the same here. I have a horribly ugly version of
the double-metaphone algorithm in python that does work, and may be of
some use in solving this problem.
tjg. [Timothy Grant]
More information about the Python-list