Good afternoon. I am wondering if anyone can point me to an equivalent derivation of the SQL Server Soundex algorithm. I have written my own version of SOUNDEX based on research I have done, however there seems to be a slight nuance in my implementation that doens't quite give me 100% match when comparing to SQL implementation.

Good afternoon. I am wondering if anyone can point me to an equivalent derivation of the SQL Server Soundex algorithm. I have written my own version of SOUNDEX based on research I have done, however there seems to be a slight nuance in my implementation that doens't quite give me 100% match when comparing to SQL implementation.

Thanks,Dan

You may want to consider Double Metaphone or even Metaphone3 which is not free but you can get it from the author's website for around $30

This information is great. We are looking at other fuzzy matching like metaphone and double metaphone for new implementations.

Though currently we need to stick with Soundex for our matching since we have multiple versions of SQL Server that being 2008 and 2012 that we are using soundex for billions of rows of data.

2012 has introduced a change to soundex algorithm so in order to stay consistent we would need to use either copatability level 100 or use our own implementation. I notice that the implementation I used handle adjacent codes that are the same by collapsing the two codes into one.

Example: Morman M=6 N=6 reduces to 60 at the end instead of SQL 66

I wasn't sure if there was more that is why i was going to trying and mimic one to one intead of having to change the compatability mode on 2012 instance.