Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
quickly (0) - 191 freq juickly (1) - 1 freq qwickly (1) - 1 freq sickly (2) - 6 freq ruckly (2) - 6 freq quicken (2) - 4 freq quicklie (2) - 2 freq thickly (2) - 1 freq quick (2) - 374 freq lickly (2) - 3 freq prickly (2) - 2 freq quickie (2) - 1 freq muckly (2) - 1 freq queekly (2) - 6 freq quirky (2) - 4 freq rickly (2) - 1 freq quirkily (2) - 1 freq quietly (2) - 61 freq wickly (2) - 2 freq puckly (2) - 12 freq quicker (2) - 57 freq laeckly (3) - 1 freq tucky (3) - 12 freq vicky (3) - 15 freq prickle (3) - 1 freq |
quickly (0) - 191 freq quicklie (2) - 2 freq juickly (2) - 1 freq qwickly (2) - 1 freq quirkily (3) - 1 freq muckly (3) - 1 freq queekly (3) - 6 freq wickly (3) - 2 freq quicker (3) - 57 freq puckly (3) - 12 freq quickie (3) - 1 freq rickly (3) - 1 freq quicken (3) - 4 freq ruckly (3) - 6 freq quick (3) - 374 freq sickly (3) - 6 freq lickly (3) - 3 freq quaicked (4) - 7 freq quacks (4) - 1 freq rickle (4) - 31 freq lackly (4) - 4 freq luckily (4) - 34 freq tickle (4) - 13 freq quacked (4) - 1 freq muckle (4) - 2854 freq |
SoundEx code - Q240 quickly - 191 freq queekly - 6 freq qwickly - 1 freq quicklie - 2 freq queeklee - 1 freq qcwql - 1 freq |
MetaPhone code - KKL quickly - 191 freq gaggle - 5 freq cockle - 4 freq keckle - 8 freq co-equally - 1 freq google - 80 freq queekly - 6 freq cackle - 7 freq goggle - 1 freq cclew - 7 freq googly - 3 freq coggly - 1 freq gogol - 2 freq cagoule - 2 freq quicklie - 2 freq coklay - 1 freq queeklee - 1 freq wcgl - 1 freq cgl - 2 freq qgl - 1 freq hhgqul - 1 freq |
QUICKLY quick - 374 freq quicker - 57 freq quickly - 191 freq quickest - 9 freq quickie - 1 freq quicklie - 2 freq |
Time to execute Levenshtein function - 0.238054 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.329218 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.027397 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.040246 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.001106 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. |