| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| withdraw (0) - 3 freq withdraa (1) - 1 freq withdrawn (1) - 2 freq withdrew (1) - 7 freq withdraan (2) - 1 freq wither'd (3) - 1 freq withers (3) - 5 freq witherer (3) - 2 freq witherin (3) - 4 freq wither's (3) - 1 freq wildlaw (3) - 13 freq thraw (3) - 45 freq athraw (3) - 1 freq withal (3) - 1 freq withered (3) - 6 freq wither (3) - 142 freq withir (3) - 3 freq withma (3) - 1 freq withert (3) - 4 freq withr (3) - 1 freq withoot (4) - 405 freq anthrax (4) - 2 freq withall (4) - 1 freq mithir (4) - 15 freq withen (4) - 5 freq |
withdraw (0) - 3 freq withdrew (1) - 7 freq withdrawn (2) - 2 freq withdraa (2) - 1 freq withdraan (3) - 1 freq wither (5) - 142 freq athraw (5) - 1 freq withir (5) - 3 freq thraw (5) - 45 freq withr (5) - 1 freq withert (5) - 4 freq withered (5) - 6 freq withers (5) - 5 freq witherer (5) - 2 freq witherin (5) - 4 freq throw (6) - 210 freq wuther (6) - 3 freq wether (6) - 2 freq thorow (6) - 1 freq wathered (6) - 1 freq wathers (6) - 1 freq inthrow (6) - 1 freq threw (6) - 93 freq waithur (6) - 1 freq waithers (6) - 1 freq |
SoundEx code - W336 withdraa - 1 freq withdraan - 1 freq withdrew - 7 freq withdrawn - 2 freq withdraw - 3 freq |
MetaPhone code - W0TR withdraa - 1 freq withdrew - 7 freq withdraw - 3 freq |
WITHDRAW |
| Time to execute Levenshtein function - 0.283407 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.701287 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.075144 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.037396 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.000839 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. |