| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kmcall (0) - 4 freq small (2) - 73 freq call (2) - 216 freq €œcall (2) - 2 freq mccall (2) - 3 freq mall (2) - 4 freq recall (2) - 10 freq ball (3) - 62 freq mell (3) - 23 freq itall (3) - 1 freq swall (3) - 20 freq 'wall (3) - 1 freq rouall (3) - 4 freq aall (3) - 3 freq kmcharg (3) - 13 freq ducale (3) - 1 freq ryall (3) - 1 freq mealy (3) - 5 freq cal (3) - 29 freq pall (3) - 5 freq n'all (3) - 2 freq myll (3) - 2 freq meal- (3) - 1 freq €˜all (3) - 5 freq kunal (3) - 11 freq |
kmcall (0) - 4 freq recall (4) - 10 freq mccall (4) - 3 freq mall (4) - 4 freq €œcall (4) - 2 freq small (4) - 73 freq call (4) - 216 freq me'll (5) - 4 freq mill (5) - 80 freq locally (5) - 16 freq calle (5) - 2 freq kmcsv (5) - 1 freq mccoll (5) - 9 freq kill (5) - 215 freq recaall (5) - 1 freq knell (5) - 5 freq mcarle (5) - 2 freq ma'll (5) - 1 freq kull (5) - 3 freq ken'll (5) - 1 freq mcgill (5) - 2 freq mcallum (5) - 1 freq kmc (5) - 2 freq mull (5) - 33 freq jmcl (5) - 21 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 - KMKL comical - 4 freq kmcall - 4 freq |
KMCALL |
| Time to execute Levenshtein function - 0.249389 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.397554 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.027548 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.037482 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.000766 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. |