| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kiddit (0) - 1 freq kiddet (1) - 3 freq widdit (1) - 2 freq hiddit (1) - 2 freq kiddie (1) - 2 freq kiddin (1) - 70 freq fidgit (2) - 3 freq middie (2) - 7 freq iddir (2) - 11 freq riddi (2) - 1 freq kidd (2) - 7 freq hiddilt (2) - 1 freq wuddit (2) - 1 freq kikkit (2) - 1 freq kidder (2) - 4 freq haddit (2) - 1 freq kildie (2) - 5 freq killit (2) - 6 freq kistit (2) - 7 freq kiddy (2) - 1 freq wirdit (2) - 1 freq mirdit (2) - 1 freq aidit (2) - 1 freq sidit (2) - 1 freq waddit (2) - 3 freq |
kiddit (0) - 1 freq kiddet (1) - 3 freq kiddie (2) - 2 freq kiddin (2) - 70 freq widdit (2) - 2 freq hiddit (2) - 2 freq beddit (3) - 16 freq daddit (3) - 5 freq waddit (3) - 3 freq feddit (3) - 1 freq kiddo (3) - 1 freq loddit (3) - 2 freq reddit (3) - 13 freq addit (3) - 97 freq kiddies (3) - 2 freq roddit (3) - 1 freq kidded (3) - 1 freq noddit (3) - 122 freq paddit (3) - 2 freq kidds (3) - 2 freq heddit (3) - 1 freq kidd (3) - 7 freq hoddit (3) - 1 freq kiddy (3) - 1 freq haddit (3) - 1 freq |
SoundEx code - K330 kythed - 95 freq kiddit - 1 freq kythit - 25 freq kittit - 2 freq kiddet - 3 freq kitted - 10 freq kytht - 3 freq kyth't - 1 freq kidded - 1 freq ktid - 1 freq |
MetaPhone code - KTT cat'd - 1 freq gutted - 32 freq cuttit - 21 freq guidit - 17 freq quoted - 9 freq kiddit - 1 freq quotit - 11 freq gteat - 1 freq guttit - 4 freq goadit - 3 freq guttet - 8 freq guided - 16 freq coatit - 5 freq cutted - 1 freq cuddied - 1 freq quieted - 1 freq coated - 4 freq kittit - 2 freq coatet - 3 freq kiddet - 3 freq cadet - 2 freq kitted - 10 freq quietude - 1 freq quottit - 1 freq gated - 1 freq quited - 1 freq caaed-oot - 1 freq goaded - 1 freq godot - 1 freq coded - 2 freq €™guided - 1 freq gtid - 1 freq kidded - 1 freq ctodd - 1 freq ktid - 1 freq |
KIDDIT |
| Time to execute Levenshtein function - 0.213902 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.456951 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.030582 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.040735 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.001009 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. |