| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kiddiejon (0) - 2 freq kiddie-on (1) - 1 freq kiddin-on (2) - 1 freq kiddie (3) - 1 freq kiddies (3) - 2 freq kiddin (3) - 70 freq middleton (3) - 7 freq hidden (4) - 64 freq bidie-in (4) - 7 freq kiemon (4) - 1 freq bidden (4) - 35 freq skidden (4) - 1 freq kindleen (4) - 1 freq riddied (4) - 1 freq kiddin (4) - 1 freq yiddie (4) - 1 freq kiddie-on-ay (4) - 1 freq diddie (4) - 2 freq kildie (4) - 5 freq biddie's (4) - 1 freq biddie (4) - 1 freq kiddo (4) - 1 freq kildies' (4) - 1 freq kiddit (4) - 1 freq hiddin (4) - 1 freq |
kiddiejon (0) - 2 freq kiddie-on (2) - 1 freq kiddin (4) - 70 freq kiddin-on (4) - 1 freq kiddies (5) - 2 freq kiddie (5) - 1 freq widdin (6) - 4 freq cuddie-an (6) - 1 freq kiddin' (6) - 1 freq fiddian (6) - 1 freq riddin (6) - 1 freq addition (6) - 17 freq biddin (6) - 30 freq kidder (6) - 4 freq kidded (6) - 1 freq kiddet (6) - 3 freq ridden (6) - 8 freq skiddin (6) - 4 freq middeen (6) - 2 freq widderin (6) - 1 freq widden (6) - 133 freq sidden (6) - 16 freq middleen (6) - 2 freq kindon (6) - 1 freq kidding (6) - 8 freq |
SoundEx code - K325 kitchen - 420 freq kitchens - 6 freq keetcheen - 2 freq ketchin - 1 freq kitchenette - 2 freq keetchen - 9 freq kitcheen - 6 freq kitchener's - 1 freq keetchin - 3 freq kitchin - 2 freq keetchins - 1 freq kaatchin - 2 freq kitchen's - 2 freq kitson - 1 freq kitchn - 1 freq keithsinclair - 1 freq ktkn - 1 freq kiddiejon - 2 freq 'kitchen' - 1 freq kdaeccynk - 1 freq katiejoand - 1 freq |
MetaPhone code - KTJN kiddiejon - 2 freq |
KIDDIEJON |
| Time to execute Levenshtein function - 0.186306 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.330927 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.027299 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.036644 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.000800 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. |