| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| muffled (0) - 18 freq ruffled (1) - 4 freq muffler (1) - 1 freq muffed (1) - 1 freq muffle (1) - 4 freq mumbled (2) - 6 freq mungled (2) - 1 freq fuffle (2) - 1 freq fuffed (2) - 1 freq muddled (2) - 4 freq mufflelt (2) - 1 freq mummled (2) - 11 freq reffled (2) - 2 freq mufflin (2) - 2 freq cuffed (2) - 1 freq tuffed (2) - 1 freq ruffles (2) - 1 freq murled (2) - 1 freq puffed (2) - 18 freq duffle (2) - 2 freq waffled (2) - 1 freq raffled (2) - 2 freq bumfled (2) - 1 freq guffed (2) - 4 freq miffed (2) - 4 freq |
muffled (0) - 18 freq muffed (2) - 1 freq muffle (2) - 4 freq muffler (2) - 1 freq ruffled (2) - 4 freq mufflin (3) - 2 freq miffed (3) - 4 freq waffled (3) - 1 freq reffled (3) - 2 freq raffled (3) - 2 freq baffled (3) - 4 freq snuffled (4) - 1 freq guffed (4) - 4 freq mulled (4) - 2 freq nuffield (4) - 3 freq buffed (4) - 1 freq purfled (4) - 1 freq bumfled (4) - 1 freq huffed (4) - 3 freq ruffle (4) - 5 freq shuffled (4) - 11 freq murmled (4) - 5 freq muffet (4) - 5 freq fuffed (4) - 1 freq muddled (4) - 4 freq |
SoundEx code - M143 muffled - 18 freq mobility - 6 freq mayfield - 3 freq mayfieldtait - 1 freq |
MetaPhone code - MFLT muffled - 18 freq mayfield - 3 freq |
MUFFLED |
| Time to execute Levenshtein function - 0.196318 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.358087 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.027685 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.038997 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.000843 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. |