| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| upwellin (0) - 1 freq dwellin (2) - 4 freq swellin (2) - 4 freq unwillin (2) - 7 freq spellin (2) - 193 freq towellin (2) - 1 freq wellin (2) - 5 freq revellin (3) - 3 freq pummellin (3) - 1 freq appellit (3) - 1 freq sweelin (3) - 13 freq modellin (3) - 3 freq upendin (3) - 1 freq spellins (3) - 71 freq tweelin (3) - 2 freq b'tellin (3) - 1 freq rummellin (3) - 1 freq resellin (3) - 1 freq kweelin (3) - 1 freq fellin (3) - 3 freq repellin (3) - 2 freq appeelin (3) - 1 freq bowllin (3) - 2 freq smellin (3) - 15 freq yellin (3) - 13 freq |
upwellin (0) - 1 freq towellin (3) - 1 freq unwillin (3) - 7 freq wellin (3) - 5 freq dwellin (3) - 4 freq swellin (3) - 4 freq swallin (4) - 11 freq pewlin (4) - 1 freq pallin (4) - 2 freq bowllin (4) - 2 freq wullin (4) - 23 freq wellen (4) - 1 freq pollin (4) - 10 freq willin (4) - 59 freq pullin (4) - 107 freq appallin (4) - 2 freq swillin (4) - 2 freq dwallin (4) - 15 freq spellin (4) - 193 freq unwillint (5) - 1 freq bellin (5) - 3 freq sellin (5) - 70 freq duellin (5) - 2 freq dellin (5) - 5 freq tellin (5) - 611 freq |
SoundEx code - U145 uplan - 4 freq upland - 5 freq uplans - 2 freq uplands - 2 freq upwellin - 1 freq uplins - 1 freq ublinkin - 1 freq uplauns - 2 freq |
MetaPhone code - UPWLN upwellin - 1 freq |
UPWELLIN |
| Time to execute Levenshtein function - 0.243593 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.414646 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.029915 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.039910 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.001036 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. |