Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
kmcalindon (0) - 5 freq calidon (3) - 1 freq macinnon (4) - 1 freq mcaloon (4) - 2 freq clinton (4) - 3 freq mckinnon (4) - 1 freq kindon (4) - 1 freq colinton (4) - 1 freq cairton (5) - 3 freq blindin (5) - 10 freq €œlondon (5) - 2 freq mcglynn (5) - 2 freq alison (5) - 410 freq marion (5) - 42 freq canton (5) - 2 freq mellishon (5) - 2 freq macarifdn (5) - 2 freq klingons (5) - 1 freq malinconia (5) - 1 freq mclennan (5) - 10 freq mindin (5) - 154 freq mcginn (5) - 3 freq 'clinton' (5) - 1 freq calumdan (5) - 1 freq kalimpong (5) - 10 freq |
kmcalindon (0) - 5 freq calidon (6) - 1 freq colinton (7) - 1 freq kindon (7) - 1 freq mclennan (7) - 10 freq mckinnon (7) - 1 freq macinnon (7) - 1 freq mcaloon (7) - 2 freq clinton (7) - 3 freq clingin (8) - 21 freq lundon (8) - 2 freq scaldin (8) - 1 freq macaloon (8) - 1 freq mackinnon (8) - 6 freq clarendon (8) - 1 freq cylinder (8) - 6 freq celandine (8) - 2 freq linden (8) - 11 freq clingan (8) - 2 freq mcann (8) - 1 freq kmcall (8) - 4 freq mcalpine (8) - 8 freq calmdoon (8) - 1 freq nmcginn (8) - 1 freq cislondon (8) - 1 freq |
SoundEx code - K524 knuckles - 29 freq knucklin - 1 freq kingholm - 1 freq knuckle - 5 freq knockahollet - 2 freq kinglassie - 4 freq kinglassiet - 1 freq king'll - 1 freq knuckle-kaimed - 1 freq knuckledusters - 1 freq kingly - 1 freq kensalem - 1 freq knuckled - 4 freq knukkilt - 1 freq kinglike - 1 freq knackie-lyeukin - 1 freq knucklebones - 1 freq koonsuls - 1 freq knuckleheids - 1 freq kungles - 1 freq konkleuzhin - 1 freq kayenicolson - 1 freq kingswells - 4 freq knocklayd - 1 freq kenmccoll - 1 freq kmcalindon - 5 freq kmcall - 4 freq kimnicoll - 2 freq |
MetaPhone code - KMKLNTN kmcalindon - 5 freq |
KMCALINDON |
Time to execute Levenshtein function - 0.514124 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 - 1.095842 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.085498 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.101513 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.001075 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. |