| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| withdraan (0) - 1 freq withdrawn (1) - 2 freq withdraa (1) - 1 freq withdraw (2) - 3 freq withdrew (3) - 7 freq thraan (3) - 12 freq witherin (3) - 4 freq withstaun (3) - 2 freq thrain (4) - 1 freq kithan (4) - 1 freq watherin (4) - 1 freq withouten (4) - 2 freq itherhaun (4) - 1 freq withen (4) - 5 freq draan (4) - 23 freq within-a (4) - 1 freq switherin (4) - 27 freq withers (4) - 5 freq gatheran (4) - 2 freq within (4) - 189 freq whurlan (4) - 1 freq writhan (4) - 1 freq wither'd (4) - 1 freq nitherin (4) - 3 freq wide-an (4) - 1 freq |
withdraan (0) - 1 freq withdraa (2) - 1 freq withdrawn (2) - 2 freq withdraw (3) - 3 freq withdrew (4) - 7 freq witherin (4) - 4 freq watherin (5) - 1 freq thraan (5) - 12 freq withstaun (5) - 2 freq intherain (6) - 1 freq winderan (6) - 2 freq thraain (6) - 1 freq whithoarn (6) - 1 freq withered (6) - 7 freq witherer (6) - 2 freq withert (6) - 4 freq windrin (6) - 4 freq withir (6) - 3 freq lutheran (6) - 1 freq withr (6) - 1 freq waathirman (6) - 1 freq githerin (6) - 2 freq witterin (6) - 3 freq whirran (6) - 1 freq whithorn (6) - 2 freq |
SoundEx code - W336 withdraa - 1 freq withdraan - 1 freq withdrew - 7 freq withdrawn - 2 freq withdraw - 3 freq |
MetaPhone code - W0TRN withdraan - 1 freq withdrawn - 2 freq |
WITHDRAAN |
| Time to execute Levenshtein function - 0.221924 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.414667 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.034806 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.038602 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.001159 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. |