Re: (Long post) Metaphone Algorithm In AWK

Ben Bacarisse <ben@bsb.me.uk> wrote:

I don't know what your are asking for as this (your latest AWK) is not
just an implementation of the metaphone algorithm.  With the extra
Levenshtein test it "texas" matches only a few words.

Not seeking/asking for anything Ben, just enjoy the ride =)

As for my Metaphone take... In fact it is. Several Metaphone variants
use Levenshtein & can be any mixture of three types of Metaphone
versions further still, or even a mix. Seems that's the way it is
in the wild...
 

However, if I remove the extra condition (that levenshtein($x, find) <=
2) your AWK code matches a different set of words to the C
implementation.  Looking a bit deeper, your AWK code give the code TKSS
to the word "texas" but the C code assigns is "TKS".

Just differing metaphone variants, witness...

Texas = Tex[ess] (if phonetically pronounced - almost slurred sounding)

But hey: Many thanks for your input kind sir, I appreciate it.

--
:wq
Mike Sanders