| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lufted (0) - 5 freq lfted (1) - 1 freq elufted (1) - 1 freq tufted (1) - 1 freq lifted (1) - 98 freq tutted (2) - 3 freq luiffed (2) - 2 freq ruited (2) - 4 freq lurked (2) - 4 freq hutted (2) - 1 freq lucked (2) - 2 freq fuffed (2) - 1 freq wafted (2) - 7 freq rifted (2) - 1 freq lueked (2) - 2 freq bluffed (2) - 1 freq muffed (2) - 1 freq leeted (2) - 1 freq busted (2) - 5 freq lested (2) - 4 freq guffed (2) - 4 freq lunged (2) - 3 freq lumped (2) - 2 freq muted (2) - 8 freq rusted (2) - 5 freq |
lufted (0) - 5 freq lifted (1) - 98 freq elufted (1) - 1 freq lfted (1) - 1 freq liftid (2) - 1 freq tufted (2) - 1 freq lasted (3) - 15 freq lafter (3) - 1 freq hefted (3) - 24 freq luftin (3) - 2 freq listed (3) - 6 freq lufts (3) - 2 freq luftit (3) - 7 freq sifted (3) - 1 freq luft (3) - 2 freq leeted (3) - 1 freq gifted (3) - 8 freq lested (3) - 4 freq wafted (3) - 7 freq liftcd (3) - 1 freq luiffed (3) - 2 freq lyftet (3) - 2 freq rifted (3) - 1 freq liftet (3) - 17 freq leftley (4) - 3 freq |
SoundEx code - L133 liftit - 134 freq lifted - 98 freq luftit - 7 freq lufted - 5 freq lepidodendron - 1 freq lyftet - 2 freq liftet - 17 freq luve-daith - 1 freq lïftit - 3 freq liftid - 1 freq lfted - 1 freq lifitit - 2 freq |
MetaPhone code - LFTT liftit - 134 freq lifted - 98 freq luftit - 7 freq lufted - 5 freq lyftet - 2 freq liftet - 17 freq lighted - 3 freq lïftit - 3 freq liftid - 1 freq lightit - 1 freq lfted - 1 freq lifitit - 2 freq lift't - 1 freq |
LUFTED |
| Time to execute Levenshtein function - 0.212980 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.369290 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.027169 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.036731 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.000766 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. |