| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| muffle (0) - 4 freq fuffle (1) - 1 freq muffled (1) - 18 freq duffle (1) - 2 freq ruffle (1) - 5 freq muffler (1) - 1 freq muffin (2) - 16 freq mffke (2) - 1 freq mufflin (2) - 2 freq muzzle (2) - 7 freq guffie (2) - 3 freq luffly (2) - 3 freq suffre (2) - 1 freq fuffie (2) - 1 freq mufft (2) - 3 freq scuffle (2) - 4 freq muckle (2) - 2854 freq ruffles (2) - 1 freq mumble (2) - 3 freq baffle (2) - 2 freq muffet (2) - 5 freq raffle (2) - 13 freq bumfle (2) - 3 freq weffle (2) - 1 freq mufflelt (2) - 1 freq |
muffle (0) - 4 freq ruffle (2) - 5 freq duffle (2) - 2 freq muffler (2) - 1 freq muffled (2) - 18 freq fuffle (2) - 1 freq muffs (3) - 1 freq muffed (3) - 1 freq baffle (3) - 2 freq raffle (3) - 13 freq mufft (3) - 3 freq muffet (3) - 5 freq luffly (3) - 3 freq mffke (3) - 1 freq mufflin (3) - 2 freq muffin (3) - 16 freq weffle (3) - 1 freq waffle (3) - 8 freq riffle (3) - 1 freq truffle (4) - 1 freq mule (4) - 4 freq shuffle (4) - 11 freq mungle (4) - 2 freq mffr (4) - 1 freq duffel (4) - 2 freq |
SoundEx code - M140 mabel - 91 freq mobile - 57 freq maple - 6 freq maybole - 1 freq muffle - 4 freq movilla - 3 freq mayfly - 1 freq mobil - 1 freq maipil - 1 freq mbl - 1 freq mable - 2 freq |
MetaPhone code - MFL muffle - 4 freq movilla - 3 freq mayfly - 1 freq |
MUFFLE |
| Time to execute Levenshtein function - 0.213803 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.391134 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.036987 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.048141 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.001075 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. |