| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| welp (0) - 1 freq yelp (1) - 20 freq weep (1) - 18 freq wely (1) - 1 freq wels (1) - 5 freq welr (1) - 1 freq help (1) - 1140 freq weld (1) - 1 freq whelp (1) - 1 freq well (1) - 1429 freq kelp (1) - 13 freq welt (1) - 2 freq depp (2) - 1 freq vlp (2) - 1 freq terp (2) - 2 freq klp (2) - 1 freq sel (2) - 75 freq ell (2) - 1 freq werd (2) - 1 freq flp (2) - 2 freq helf (2) - 2 freq wesh (2) - 8 freq wals (2) - 1 freq fel (2) - 2 freq wop (2) - 1 freq |
welp (0) - 1 freq kelp (2) - 13 freq whelp (2) - 1 freq welt (2) - 2 freq yelp (2) - 20 freq walop (2) - 1 freq weld (2) - 1 freq well (2) - 1429 freq help (2) - 1140 freq weep (2) - 18 freq wels (2) - 5 freq wely (2) - 1 freq welr (2) - 1 freq weal (3) - 8 freq whap (3) - 2 freq weil (3) - 141 freq wls (3) - 1 freq wisp (3) - 7 freq wolf (3) - 91 freq whip (3) - 17 freq welly (3) - 5 freq wrap (3) - 49 freq wealt (3) - 1 freq wiel (3) - 1 freq wle (3) - 1 freq |
SoundEx code - W410 wolfe - 3 freq wolf - 91 freq wolfie - 5 freq whalp - 11 freq wullfu - 1 freq wallop - 11 freq weel-aff - 28 freq wulf - 6 freq weelaff - 1 freq wallopy - 1 freq whelp - 1 freq waallop - 1 freq wilfu - 1 freq willfu - 1 freq walop - 1 freq welp - 1 freq wullybh - 1 freq woolfe - 1 freq |
MetaPhone code - WLP whalp - 11 freq wallop - 11 freq wallopy - 1 freq whelp - 1 freq waallop - 1 freq walop - 1 freq welp - 1 freq |
WELP |
| Time to execute Levenshtein function - 0.243826 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.692800 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.028401 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.038286 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.027059 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. |