| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| queekly (0) - 6 freq queerly (1) - 1 freq squeeky (2) - 2 freq queek (2) - 22 freq seekly (2) - 1 freq queeklee (2) - 1 freq weekly (2) - 25 freq meekly (2) - 5 freq quietly (2) - 61 freq squeegly (2) - 1 freq kweekly (2) - 1 freq queeker (2) - 4 freq quickly (2) - 191 freq quaetly (2) - 2 freq peebly (3) - 2 freq luverly (3) - 4 freq queer (3) - 146 freq deedly (3) - 2 freq puckly (3) - 12 freq leckly (3) - 2 freq teely (3) - 1 freq cheeky (3) - 92 freq rudely (3) - 3 freq skeetly (3) - 1 freq cheerly (3) - 1 freq |
queekly (0) - 6 freq queerly (2) - 1 freq queeklee (2) - 1 freq quietly (3) - 61 freq quaetly (3) - 2 freq meekly (3) - 5 freq quickly (3) - 191 freq queeker (3) - 4 freq weekly (3) - 25 freq queek (3) - 22 freq seekly (3) - 1 freq weakly (4) - 6 freq quelle (4) - 1 freq laekly (4) - 29 freq puekle (4) - 1 freq qweel (4) - 1 freq skeely (4) - 22 freq quaitly (4) - 6 freq quirkily (4) - 1 freq qually (4) - 1 freq quell (4) - 5 freq reekily (4) - 1 freq lekly (4) - 2 freq quately (4) - 21 freq quarely (4) - 5 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 |
QUEEKLY |
| Time to execute Levenshtein function - 0.263677 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.484929 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.029830 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.041450 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.001074 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. |