| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| juickly (0) - 1 freq quickly (1) - 191 freq wickly (2) - 2 freq juicy (2) - 15 freq ruckly (2) - 6 freq lickly (2) - 3 freq thickly (2) - 1 freq muckly (2) - 1 freq puckly (2) - 12 freq qwickly (2) - 1 freq rickly (2) - 1 freq prickly (2) - 2 freq sickly (2) - 6 freq brickle (3) - 1 freq freckly (3) - 2 freq sickly' (3) - 1 freq sicily (3) - 5 freq pricklt (3) - 1 freq bricky (3) - 3 freq jinky (3) - 5 freq juikt (3) - 2 freq suirly (3) - 5 freq ruchly (3) - 3 freq juicin (3) - 2 freq duick (3) - 1 freq |
juickly (0) - 1 freq quickly (2) - 191 freq puckly (3) - 12 freq sickly (3) - 6 freq rickly (3) - 1 freq muckly (3) - 1 freq wickly (3) - 2 freq ruckly (3) - 6 freq lickly (3) - 3 freq quicklie (4) - 2 freq jaicket (4) - 72 freq uckle (4) - 1 freq huckle (4) - 11 freq buckle (4) - 12 freq lackly (4) - 4 freq pickle (4) - 30 freq mueckle (4) - 2 freq jocky (4) - 25 freq joackey (4) - 3 freq luckily (4) - 34 freq rickle (4) - 31 freq jockey (4) - 3 freq muckle (4) - 2854 freq tickle (4) - 13 freq laeckly (4) - 1 freq |
SoundEx code - J240 jekyll - 14 freq jougle - 1 freq joogle - 6 freq juickly - 1 freq jeekyll - 2 freq jookle - 2 freq jacquel - 3 freq joogal - 1 freq jackal - 1 freq jajahl - 1 freq juggle - 1 freq joshhall - 1 freq |
MetaPhone code - JKL giggle - 21 freq jekyll - 14 freq jougle - 1 freq joogle - 6 freq geggle - 1 freq geegly - 1 freq juickly - 1 freq jeekyll - 2 freq jookle - 2 freq jql - 1 freq joogal - 1 freq jackal - 1 freq juggle - 1 freq |
JUICKLY |
| Time to execute Levenshtein function - 0.294139 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.638954 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.052633 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.042439 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.000894 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. |