| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aitkin (0) - 1 freq aitin (1) - 21 freq aitken (1) - 32 freq aitkins (1) - 1 freq aittin (1) - 1 freq aitkens (2) - 1 freq actin (2) - 58 freq rinkin (2) - 1 freq sitin (2) - 1 freq aidin (2) - 1 freq jinkin (2) - 17 freq winkin (2) - 16 freq aistlin (2) - 1 freq aitten (2) - 2 freq naipkin (2) - 1 freq aatin (2) - 1 freq riskin (2) - 5 freq dickin (2) - 3 freq maitin (2) - 1 freq paikin (2) - 3 freq hinkin (2) - 81 freq milkin (2) - 26 freq antrin (2) - 67 freq alkin (2) - 1 freq nithin (2) - 71 freq |
aitkin (0) - 1 freq aitken (1) - 32 freq aittin (2) - 1 freq taikin (2) - 1 freq aitkins (2) - 1 freq aitin (2) - 21 freq akin (3) - 12 freq aiten (3) - 4 freq raikin (3) - 14 freq haikin (3) - 8 freq imkin (3) - 1 freq attain (3) - 2 freq tickin (3) - 8 freq likin (3) - 38 freq aetin (3) - 27 freq daikin (3) - 1 freq tinkin (3) - 57 freq aiken (3) - 11 freq atakan (3) - 1 freq sikin (3) - 2 freq taiken (3) - 7 freq tookin (3) - 2 freq aakin (3) - 3 freq awkin (3) - 2 freq maikin (3) - 1 freq |
SoundEx code - A325 addison - 31 freq addison's - 12 freq attackin' - 1 freq attachment - 3 freq aidgin - 1 freq attackin - 8 freq aitken - 32 freq adjoinin - 2 freq ati'sunbems - 1 freq aitken's - 4 freq addisence - 1 freq audiscense - 1 freq autism - 3 freq aitkin - 1 freq atakan - 1 freq attacking - 4 freq aitkens - 1 freq aodsmegh - 1 freq aitkins - 1 freq aitkens - 1 freq adgmbfhvox - 1 freq addishanel - 1 freq atkinson - 1 freq |
MetaPhone code - ATKN attackin' - 1 freq attackin - 8 freq aitken - 32 freq aitkin - 1 freq atakan - 1 freq |
AITKIN |
| Time to execute Levenshtein function - 0.191076 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.367169 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.029759 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.037347 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000941 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |