| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fumbled (0) - 5 freq rumbled (1) - 5 freq fumblem (1) - 1 freq fumbles (1) - 2 freq tumbled (1) - 9 freq bumbled (1) - 1 freq fummled (1) - 3 freq humbled (1) - 1 freq jumbled (1) - 2 freq fumble (1) - 1 freq mumbled (1) - 6 freq stumbled (2) - 10 freq tumbles (2) - 3 freq cummled (2) - 2 freq fummles (2) - 2 freq mumble (2) - 3 freq numbed (2) - 4 freq fulled (2) - 36 freq fumed (2) - 1 freq fuelled (2) - 7 freq rumpled (2) - 2 freq tumbler (2) - 4 freq fummle (2) - 5 freq mummled (2) - 11 freq fustled (2) - 1 freq |
fumbled (0) - 5 freq humbled (2) - 1 freq jumbled (2) - 2 freq fumble (2) - 1 freq fummled (2) - 3 freq mumbled (2) - 6 freq bumbled (2) - 1 freq rumbled (2) - 5 freq fumblem (2) - 1 freq tumbled (2) - 9 freq fumbles (2) - 2 freq fabled (3) - 3 freq gambled (3) - 1 freq ambled (3) - 1 freq fumblin (3) - 1 freq rumble (4) - 9 freq mumblet (4) - 2 freq rummled (4) - 3 freq bumfled (4) - 1 freq hummled (4) - 1 freq bumble (4) - 2 freq furled (4) - 11 freq rumbles (4) - 3 freq humble (4) - 27 freq wummled (4) - 3 freq |
SoundEx code - F514 faem-flecked - 1 freq fumbled - 5 freq fumbling - 2 freq fumble - 1 freq fumblem - 1 freq fumblin - 1 freq finfolk - 1 freq fumbles - 2 freq fiannafailparty - 1 freq |
MetaPhone code - FMLT fummled - 3 freq fumbled - 5 freq fummlt - 1 freq fummelt - 1 freq fumml't - 1 freq |
FUMBLED |
| Time to execute Levenshtein function - 0.806146 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 - 1.276041 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.028080 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.181518 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.001167 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. |