| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bummlin (0) - 2 freq jummlin (1) - 1 freq wummlin (1) - 1 freq bummin (1) - 20 freq tummlin (1) - 26 freq rummlin (1) - 24 freq fummlin (1) - 4 freq bummelin (1) - 1 freq bumflin (1) - 1 freq mummlin (1) - 7 freq mummlit (2) - 2 freq wummin (2) - 233 freq rumplin (2) - 1 freq dumplin (2) - 25 freq grummlin (2) - 7 freq trummlin (2) - 1 freq tummlan (2) - 1 freq bustlin (2) - 4 freq stummlin (2) - 1 freq crummlin (2) - 8 freq burlin (2) - 8 freq cummin (2) - 30 freq rummelin (2) - 1 freq bammin (2) - 3 freq fumblin (2) - 1 freq |
bummlin (0) - 2 freq bummelin (1) - 1 freq fummlin (2) - 4 freq bumflin (2) - 1 freq rummlin (2) - 24 freq mummlin (2) - 7 freq tummlin (2) - 26 freq wummlin (2) - 1 freq jummlin (2) - 1 freq bummin (2) - 20 freq rummilin (3) - 1 freq gammlin (3) - 5 freq mummilin (3) - 1 freq tummelin (3) - 1 freq bammin (3) - 3 freq rummlan (3) - 1 freq rummelin (3) - 1 freq wammlin (3) - 6 freq waummlin (3) - 1 freq mummlan (3) - 2 freq rammlin (3) - 2 freq tummlan (3) - 1 freq hummin (4) - 18 freq gummin (4) - 1 freq bulin (4) - 1 freq |
SoundEx code - B545 bummlin - 2 freq bummelin - 1 freq bunlan - 1 freq bmilliant - 1 freq |
MetaPhone code - BMLN bummlin - 2 freq bummelin - 1 freq |
BUMMLIN |
| Time to execute Levenshtein function - 0.235875 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.400035 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.031900 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.042800 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.001107 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. |