| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| upendin (0) - 1 freq unendin (1) - 2 freq pendin (1) - 3 freq spendin (1) - 33 freq brendin (2) - 1 freq lendin (2) - 3 freq trendin (2) - 2 freq speidin (2) - 1 freq onendin (2) - 1 freq pennin (2) - 2 freq speldin (2) - 1 freq sendin (2) - 63 freq blendin (2) - 3 freq apenin (2) - 10 freq vendin (2) - 2 freq endin (2) - 43 freq tendin (2) - 9 freq fendin (2) - 5 freq stendin (2) - 1 freq unenin (2) - 1 freq spending (2) - 9 freq impendin (2) - 9 freq pensin (2) - 3 freq spennin (2) - 21 freq bendin (2) - 15 freq |
upendin (0) - 1 freq pendin (1) - 3 freq spendin (2) - 33 freq pundin (2) - 1 freq unendin (2) - 2 freq mendin (3) - 10 freq pendil (3) - 9 freq bendin (3) - 15 freq pensin (3) - 3 freq impendin (3) - 9 freq pending (3) - 1 freq dependin (3) - 26 freq upended (3) - 1 freq openin (3) - 126 freq fendin (3) - 5 freq pentin (3) - 23 freq poondin (3) - 3 freq poundin (3) - 12 freq apenin (3) - 10 freq sendin (3) - 63 freq onendin (3) - 1 freq lendin (3) - 3 freq vendin (3) - 2 freq pennin (3) - 2 freq tendin (3) - 9 freq |
SoundEx code - U153 upendin - 1 freq upended - 1 freq up-and-doon - 1 freq up-wund - 1 freq ubuntu - 1 freq uefaunder - 1 freq u-bend - 1 freq upwind - 1 freq |
MetaPhone code - UPNTN upendin - 1 freq |
UPENDIN |
| Time to execute Levenshtein function - 0.246653 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.411565 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.030350 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.039547 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.001043 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. |