| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| quickest (0) - 9 freq quicker (2) - 57 freq quietest (2) - 1 freq quicken (2) - 4 freq quickens (2) - 1 freq sickest (2) - 1 freq juiciest (2) - 2 freq quickint (2) - 2 freq thickest (2) - 1 freq quackit (3) - 2 freq sickelt (3) - 1 freq dairkest (3) - 3 freq quiknes (3) - 1 freq jaicket (3) - 68 freq quick (3) - 371 freq queerest (3) - 6 freq flickert (3) - 2 freq suinest (3) - 2 freq quiche (3) - 3 freq quacked (3) - 1 freq quickened (3) - 3 freq quickenin (3) - 1 freq luckiest (3) - 2 freq blackest (3) - 4 freq tricket (3) - 9 freq |
quickest (0) - 9 freq sickest (3) - 1 freq quickint (3) - 2 freq quackit (4) - 2 freq quacks (4) - 1 freq quickstep (4) - 2 freq thickest (4) - 1 freq luckiest (4) - 2 freq quicksan (4) - 1 freq quickens (4) - 1 freq juiciest (4) - 2 freq quicken (4) - 4 freq quietest (4) - 1 freq quicker (4) - 57 freq quilkit (5) - 2 freq picket (5) - 24 freq laichest (5) - 2 freq quickly (5) - 184 freq nicest (5) - 6 freq mirkest (5) - 2 freq mucklest (5) - 8 freq quicklie (5) - 2 freq quackery (5) - 1 freq buckelt (5) - 2 freq rickste (5) - 1 freq |
SoundEx code - Q223 quickest - 9 freq |
MetaPhone code - KKST quickest - 9 freq coaxit - 1 freq coaxed - 3 freq coaxt - 1 freq quixote - 2 freq hcxiti - 1 freq |
QUICKEST |
| Time to execute Levenshtein function - 0.494784 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 - 1.012246 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.087966 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.103100 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.000804 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. |