| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| suzyqfit (0) - 1 freq sunlit (4) - 2 freq styfie (4) - 1 freq surfeit (4) - 1 freq sax-fit (4) - 1 freq suzie (4) - 5 freq sumyin (4) - 1 freq suit (4) - 159 freq suppit (4) - 10 freq sumit (4) - 1 freq puffit (4) - 3 freq submitit (4) - 1 freq splehfit (4) - 1 freq stuffit (4) - 1 freq spulyit (4) - 2 freq skyrit (4) - 1 freq spyit (4) - 3 freq synit (4) - 1 freq summonit (4) - 2 freq suffix (4) - 20 freq sunripit (4) - 1 freq smyllit (4) - 1 freq shugyit (4) - 1 freq sufferit (4) - 1 freq uzqcfib (4) - 1 freq |
suzyqfit (0) - 1 freq stuffit (6) - 1 freq six-fit (6) - 2 freq stairfit (6) - 1 freq saufit (6) - 1 freq sniffit (6) - 9 freq sax-fit (6) - 1 freq surfeit (6) - 1 freq sqint (7) - 1 freq scythit (7) - 1 freq skift (7) - 3 freq sauft (7) - 1 freq snaa-fite (7) - 1 freq szqsue (7) - 1 freq suzieq (7) - 3 freq wudfit (7) - 2 freq unfit (7) - 1 freq submit (7) - 13 freq sufi (7) - 1 freq sulkit (7) - 3 freq quhyit (7) - 2 freq burnfit (7) - 10 freq suitit (7) - 8 freq sizzent (7) - 1 freq scrybit (7) - 1 freq |
SoundEx code - S221 successfu - 14 freq shakespeare - 36 freq 'shakespeare - 3 freq successive - 4 freq shakespeare's - 3 freq successful - 21 freq succesfu - 1 freq successfae - 4 freq succesfae - 1 freq shakespeare' - 3 freq shakespeare-owersettin - 1 freq shakespearean - 3 freq successfully - 7 freq successsfu - 1 freq sucessfu - 1 freq saxe-coburg-gotha - 1 freq €˜successful - 1 freq shakespearian - 2 freq scaceqpvwp - 1 freq swgoksxbzs - 1 freq suzyqfit - 1 freq suesuezep - 1 freq |
MetaPhone code - SSKFT suzyqfit - 1 freq |
SUZYQFIT |
| Time to execute Levenshtein function - 0.256332 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.459543 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.027896 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.038455 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.000882 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. |