| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| quixote (0) - 2 freq quote (2) - 50 freq quite (2) - 475 freq suimope (3) - 1 freq quince (3) - 2 freq quiche (3) - 3 freq quinie (3) - 82 freq quint (3) - 1 freq suite (3) - 16 freq quile (3) - 1 freq quieten (3) - 2 freq quilted (3) - 1 freq quited (3) - 1 freq quine (3) - 587 freq quota (3) - 1 freq quinnie (3) - 7 freq quiet (3) - 239 freq quieter (3) - 9 freq quilts (3) - 2 freq quilt (3) - 23 freq quate (3) - 161 freq quinty (3) - 1 freq quoted (3) - 8 freq quieted (3) - 1 freq quot (3) - 15 freq |
quixote (0) - 2 freq quote (3) - 50 freq quite (3) - 475 freq quiet (4) - 239 freq quot (4) - 15 freq quit (4) - 28 freq quinty (4) - 1 freq quiat (4) - 2 freq quint (4) - 1 freq quietie (4) - 1 freq quate (4) - 161 freq quitie (4) - 2 freq quota (4) - 1 freq quilt (4) - 23 freq queat (5) - 11 freq sixt (5) - 5 freq quanta (5) - 1 freq quhyt (5) - 5 freq mixt (5) - 8 freq nixt (5) - 473 freq quat (5) - 31 freq quehit (5) - 2 freq quyt (5) - 3 freq quaiet (5) - 4 freq qualitie (5) - 12 freq |
SoundEx code - Q230 quacked - 1 freq quest - 18 freq quact - 1 freq quayside - 3 freq quaicked - 7 freq quixote - 2 freq quackit - 2 freq quaikit - 1 freq quizzed - 1 freq quctae - 1 freq |
MetaPhone code - KKST quickest - 9 freq coaxit - 1 freq coaxed - 3 freq coaxt - 1 freq quixote - 2 freq hcxiti - 1 freq |
QUIXOTE |
| Time to execute Levenshtein function - 0.263010 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.414615 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.045978 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.062762 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.001144 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. |