| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tummlin (0) - 26 freq trummlin (1) - 1 freq mummlin (1) - 7 freq tumlin (1) - 1 freq jummlin (1) - 1 freq bummlin (1) - 2 freq rummlin (1) - 24 freq stummlin (1) - 1 freq tummelin (1) - 1 freq fummlin (1) - 4 freq tummlan (1) - 1 freq wummlin (1) - 1 freq tumblin (1) - 5 freq tummlt (2) - 8 freq murmlin (2) - 2 freq mummlit (2) - 2 freq hummin (2) - 18 freq gammlin (2) - 5 freq wammlin (2) - 6 freq tumblan (2) - 2 freq stumblin (2) - 9 freq mumblin (2) - 2 freq tummles (2) - 2 freq tummler (2) - 3 freq tummlet (2) - 3 freq |
tummlin (0) - 26 freq tummelin (1) - 1 freq tummlan (1) - 1 freq fummlin (2) - 4 freq tumlin (2) - 1 freq tumblin (2) - 5 freq trummlin (2) - 1 freq mummlin (2) - 7 freq wummlin (2) - 1 freq stummlin (2) - 1 freq jummlin (2) - 1 freq bummlin (2) - 2 freq rummlin (2) - 24 freq trimmlin (3) - 30 freq tremlin (3) - 2 freq tremmlin (3) - 27 freq a-tummlin (3) - 1 freq mummlan (3) - 2 freq rummlan (3) - 1 freq trummelin (3) - 1 freq tummle (3) - 19 freq rammlin (3) - 2 freq trimlin (3) - 1 freq bummelin (3) - 1 freq rummelin (3) - 1 freq |
SoundEx code - T545 tummlin - 26 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 - 5 freq tummlin - 26 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.239317 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.603685 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.061728 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.044469 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.001189 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. |