| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| queeklee (0) - 1 freq queekly (2) - 6 freq queeker (2) - 4 freq queek (3) - 22 freq reelee (3) - 1 freq queerer (3) - 2 freq squeeked (3) - 1 freq mueckle (3) - 2 freq queenie (3) - 3 freq queeried (3) - 3 freq queerly (3) - 1 freq puekle (3) - 1 freq quelle (3) - 1 freq queelin (3) - 1 freq quaetlie (3) - 2 freq squeeled (3) - 1 freq queenies (3) - 1 freq quicklie (3) - 2 freq queerie (3) - 8 freq queereye (3) - 1 freq queerlike (3) - 3 freq squeegee (3) - 2 freq sterklee (3) - 1 freq queerlik (3) - 1 freq queet (4) - 2 freq |
queeklee (0) - 1 freq queekly (2) - 6 freq queeker (3) - 4 freq quaetlie (4) - 2 freq quicklie (4) - 2 freq puekle (4) - 1 freq queek (4) - 22 freq queerly (4) - 1 freq quelle (4) - 1 freq meikle (5) - 4 freq liklee (5) - 1 freq quhile (5) - 5 freq quickly (5) - 191 freq quietly (5) - 61 freq quaetly (5) - 2 freq mukle (5) - 1 freq seiklie (5) - 1 freq qweel (5) - 1 freq seekly (5) - 1 freq quile (5) - 1 freq skeelie (5) - 32 freq uckle (5) - 1 freq feklie (5) - 1 freq keele (5) - 1 freq quake (5) - 7 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 |
QUEEKLEE |
| Time to execute Levenshtein function - 0.203312 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.409936 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.028676 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.038449 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.000994 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. |