| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| undoin (0) - 1 freq undon (1) - 1 freq undain (1) - 1 freq undoan (1) - 2 freq unduin (1) - 1 freq lundin (2) - 1 freq uncoil (2) - 2 freq undaen (2) - 1 freq sundown (2) - 1 freq sundoun (2) - 11 freq undone (2) - 4 freq union (2) - 192 freq endin (2) - 43 freq undeid (2) - 3 freq fundin (2) - 62 freq unenin (2) - 1 freq unhovin (2) - 1 freq unmovin (2) - 1 freq undeun (2) - 1 freq sundoon (2) - 2 freq undaein (2) - 2 freq unborn (2) - 7 freq pundin (2) - 1 freq jundyin (2) - 3 freq doin (2) - 75 freq |
undoin (0) - 1 freq undoan (1) - 2 freq unduin (1) - 1 freq undain (1) - 1 freq undon (1) - 1 freq undone (2) - 4 freq endin (2) - 43 freq undeun (2) - 1 freq undaein (2) - 2 freq undaen (2) - 1 freq unkin (3) - 4 freq doin (3) - 75 freq ongoin (3) - 4 freq lundon (3) - 2 freq undo (3) - 1 freq endeen (3) - 3 freq nedin (3) - 1 freq ndaoine (3) - 1 freq andean (3) - 1 freq jundyin (3) - 3 freq endan (3) - 2 freq indian (3) - 34 freq eendoun (3) - 2 freq unitin (3) - 2 freq undeid (3) - 3 freq |
SoundEx code - U535 untimeous - 1 freq undaein - 2 freq undeimous - 8 freq unwittin - 1 freq undeemous - 23 freq undauntit - 2 freq unatendid - 1 freq untungult - 1 freq unattended - 2 freq undeniable - 2 freq untimely - 5 freq undaen - 1 freq untangle - 1 freq undone - 4 freq unthinkable - 3 freq uneaten - 1 freq untentie - 2 freq undeun - 1 freq undeeman - 2 freq unidentified - 1 freq untenty - 1 freq undoan - 2 freq undon - 1 freq untentit - 1 freq unwittinly - 1 freq undain - 1 freq undauntoned - 1 freq undemous - 6 freq unduin - 1 freq undoin - 1 freq undemotic - 1 freq undemocratic - 2 freq untamed - 1 freq undantit - 1 freq umteenth - 2 freq unitin - 2 freq unidentifiable - 1 freq |
MetaPhone code - UNTN undaein - 2 freq undaen - 1 freq undone - 4 freq uneaten - 1 freq undeun - 1 freq undoan - 2 freq undon - 1 freq undain - 1 freq unduin - 1 freq undoin - 1 freq unitin - 2 freq |
UNDOIN |
| Time to execute Levenshtein function - 0.183602 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.355079 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.027560 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.036991 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.000918 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. |