| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| malcolm (0) - 33 freq malcolme (1) - 1 freq malcolms (1) - 1 freq 'malcolm (1) - 2 freq malcom (1) - 2 freq walcom (2) - 3 freq maucom (2) - 1 freq maccoll (2) - 4 freq macm (3) - 1 freq mall (3) - 4 freq falcon (3) - 4 freq calculs (3) - 1 freq mayol (3) - 1 freq maccolla (3) - 1 freq calcul (3) - 2 freq marco (3) - 5 freq alcoho (3) - 1 freq walcum (3) - 31 freq mccoll (3) - 9 freq iancoll (3) - 1 freq mascorn (3) - 5 freq raecomm (3) - 2 freq maybole (3) - 1 freq walcome (3) - 71 freq alcorn (3) - 7 freq |
malcolm (0) - 33 freq malcolme (1) - 1 freq malcom (2) - 2 freq malcolms (2) - 1 freq 'malcolm (2) - 2 freq maccoll (4) - 4 freq mallum (4) - 1 freq walcom (4) - 3 freq maucom (4) - 1 freq talcum (5) - 1 freq mccoll (5) - 9 freq alcham (5) - 1 freq walcome (5) - 71 freq mally (5) - 1 freq welcom (5) - 1 freq walcum (5) - 31 freq calculs (5) - 1 freq balcormo (5) - 1 freq mall (5) - 4 freq macm (5) - 1 freq macel (5) - 1 freq manchem (5) - 1 freq calcul (5) - 2 freq maccolla (5) - 1 freq mausoleum (6) - 4 freq |
SoundEx code - M424 molecules - 1 freq malcolm - 33 freq 'malcolm - 2 freq millisle - 5 freq millisle' - 1 freq malcolme - 1 freq malcolms - 1 freq malcolmbrown - 3 freq malcolmnichols - 1 freq |
MetaPhone code - MLKLM malcolm - 33 freq 'malcolm - 2 freq malcolme - 1 freq |
MALCOLM |
| Time to execute Levenshtein function - 0.173300 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.370491 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.026776 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.036553 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.000775 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. |