I would like to improve name matching in simplex codes the one you implemented...
here are my improved requirements:
If AIEOU are not the first letter then change to A if not return AEIOU
-if Y not the first or last character change Y to A
-change PH -->F
-change M--> N
-remove all duplicated letters such as "smitt" should be smat (no another "t") similarly, "smmit" should be "smat" (not smmat) , or smiss shouold be smas
-change TH --> T
-change KN-> N, K-->C
If Z not the first character change Z-->S
change these suffix :
and that's it cann't think for more :)
You can have a look at some of similar example codes from:
maybe you have an idea...
p.s. hope this time it would work with my 100 names datafile...