| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| withdraa (0) - 1 freq withdraw (1) - 3 freq withdraan (1) - 1 freq withdrew (2) - 7 freq withdrawn (2) - 2 freq withr (3) - 1 freq within-a (3) - 1 freq thraa (3) - 5 freq widaa (3) - 1 freq withers (3) - 5 freq wither's (3) - 1 freq wither'd (3) - 1 freq witherin (3) - 4 freq witherer (3) - 2 freq wither (3) - 143 freq withered (3) - 7 freq withir (3) - 3 freq withma (3) - 1 freq withal (3) - 1 freq withert (3) - 4 freq enthral (4) - 2 freq either' (4) - 1 freq witter (4) - 10 freq wildlaw (4) - 13 freq wittered (4) - 6 freq |
withdraa (0) - 1 freq withdraan (2) - 1 freq withdraw (2) - 3 freq withdrew (3) - 7 freq wither (4) - 143 freq witherer (4) - 2 freq withir (4) - 3 freq withr (4) - 1 freq withdrawn (4) - 2 freq withal (5) - 1 freq withma (5) - 1 freq wathery (5) - 1 freq wether (5) - 2 freq wuther (5) - 3 freq waithur (5) - 1 freq withert (5) - 4 freq withered (5) - 7 freq withers (5) - 5 freq thraa (5) - 5 freq wather (5) - 75 freq within-a (5) - 1 freq witherin (5) - 4 freq 'ither (6) - 7 freq wathers (6) - 1 freq witer (6) - 2 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 |
WITHDRAA |
| Time to execute Levenshtein function - 0.587740 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.179201 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.128212 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.191497 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.001071 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. |