| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tummlin (0) - 25 freq mummlin (1) - 7 freq stummlin (1) - 1 freq fummlin (1) - 4 freq bummlin (1) - 2 freq jummlin (1) - 1 freq trummlin (1) - 1 freq tumblin (1) - 4 freq tumlin (1) - 1 freq wummlin (1) - 1 freq rummlin (1) - 23 freq tummelin (1) - 1 freq tummlan (1) - 1 freq summin (2) - 36 freq mummlan (2) - 2 freq stumblin (2) - 9 freq tremlin (2) - 2 freq tuimin (2) - 2 freq rumblin (2) - 12 freq trimmlin (2) - 30 freq cummin (2) - 30 freq whummlin (2) - 2 freq rumplin (2) - 1 freq mummilin (2) - 1 freq mummlit (2) - 2 freq |
tummlin (0) - 25 freq tummelin (1) - 1 freq tummlan (1) - 1 freq wummlin (2) - 1 freq rummlin (2) - 23 freq stummlin (2) - 1 freq fummlin (2) - 4 freq tumlin (2) - 1 freq mummlin (2) - 7 freq tumblin (2) - 4 freq jummlin (2) - 1 freq bummlin (2) - 2 freq trummlin (2) - 1 freq rummelin (3) - 1 freq tummled (3) - 4 freq gammlin (3) - 5 freq tumblan (3) - 2 freq tummle (3) - 19 freq tummlt (3) - 8 freq rummilin (3) - 1 freq tummles (3) - 2 freq trimlin (3) - 1 freq trummelin (3) - 1 freq rammlin (3) - 2 freq tremmlin (3) - 27 freq |
SoundEx code - T545 tummlin - 25 freq toonlan - 2 freq toonland - 1 freq toonlan' - 1 freq toonlanns - 1 freq timeline - 14 freq tummlan - 1 freq tim'line - 1 freq tomlinson - 1 freq tummelin - 1 freq tumlin - 1 freq tinlin - 1 freq tmlewin - 1 freq teamleon - 1 freq tomlang - 3 freq tomholland - 1 freq |
MetaPhone code - TMLN tumblin - 4 freq tummlin - 25 freq timeline - 14 freq tummlan - 1 freq tim'line - 1 freq tummelin - 1 freq tumblan - 2 freq tumlin - 1 freq teamleon - 1 freq |
TUMMLIN |
| Time to execute Levenshtein function - 0.204033 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.395225 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.027644 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.037525 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.000879 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. |