| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kidded (0) - 1 freq widded (1) - 1 freq kidder (1) - 4 freq kiddet (1) - 3 freq kidd (2) - 7 freq kidds (2) - 2 freq kiddo (2) - 1 freq heidded (2) - 1 freq kindred (2) - 4 freq aidder (2) - 1 freq midder (2) - 64 freq widder (2) - 4 freq kiddit (2) - 1 freq ridden (2) - 8 freq bedded (2) - 8 freq hiddled (2) - 6 freq ridder (2) - 2 freq aided (2) - 2 freq kilted (2) - 6 freq midden (2) - 92 freq wadded (2) - 1 freq bidden (2) - 36 freq riddled (2) - 7 freq sidled (2) - 2 freq tidder (2) - 50 freq |
kidded (0) - 1 freq kiddet (2) - 3 freq kidder (2) - 4 freq widded (2) - 1 freq padded (3) - 13 freq added (3) - 173 freq wadded (3) - 1 freq kiddies (3) - 2 freq kiddin (3) - 70 freq hudded (3) - 1 freq wedded (3) - 4 freq nodded (3) - 71 freq riddied (3) - 1 freq kiddie (3) - 2 freq redded (3) - 2 freq dadded (3) - 1 freq skudded (3) - 1 freq kiddy (3) - 1 freq bedded (3) - 8 freq heidded (3) - 1 freq kiddit (3) - 1 freq kidds (3) - 2 freq kiddo (3) - 1 freq kidd (3) - 7 freq fidged (4) - 7 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 |
KIDDED |
| Time to execute Levenshtein function - 0.200332 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.342067 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.028223 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.037530 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.001027 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. |