| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| qwickly (0) - 1 freq quickly (1) - 191 freq wickly (1) - 2 freq qwicker (2) - 1 freq wicely (2) - 2 freq juickly (2) - 1 freq sickly (2) - 6 freq rickly (2) - 1 freq prickly (2) - 2 freq wikkly (2) - 1 freq qwick (2) - 4 freq lickly (2) - 3 freq thickly (2) - 1 freq tricksy (3) - 1 freq sickly' (3) - 1 freq pickle (3) - 30 freq twinklt (3) - 1 freq nicely (3) - 16 freq wick' (3) - 1 freq wycely (3) - 2 freq nicky (3) - 8 freq likkly (3) - 2 freq micky (3) - 3 freq 'willy (3) - 1 freq wrinkly (3) - 8 freq |
qwickly (0) - 1 freq wickly (2) - 2 freq quickly (2) - 191 freq qwick (3) - 4 freq qwicker (3) - 1 freq lickly (4) - 3 freq wicely (4) - 2 freq wikkly (4) - 1 freq quicklie (4) - 2 freq thickly (4) - 1 freq sickly (4) - 6 freq rickly (4) - 1 freq prickly (4) - 2 freq juickly (4) - 1 freq swickit (5) - 6 freq laeckly (5) - 1 freq kweekly (5) - 1 freq tickle (5) - 13 freq swicker (5) - 1 freq wicko (5) - 1 freq qwik (5) - 4 freq wicked (5) - 25 freq lackly (5) - 4 freq twinkle (5) - 27 freq quicker (5) - 57 freq |
SoundEx code - Q240 quickly - 191 freq queekly - 6 freq qwickly - 1 freq quicklie - 2 freq queeklee - 1 freq qcwql - 1 freq |
MetaPhone code - KWKL qwickly - 1 freq kweekly - 1 freq |
QWICKLY |
| Time to execute Levenshtein function - 0.202378 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.376563 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.029844 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.038223 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.000847 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. |