| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| undone (0) - 4 freq undon (1) - 1 freq undae (2) - 3 freq undoan (2) - 2 freq union' (2) - 1 freq mundane (2) - 5 freq wndwne (2) - 1 freq anyone (2) - 67 freq 'none (2) - 1 freq lundon (2) - 2 freq union (2) - 192 freq onyone (2) - 23 freq undo (2) - 1 freq unions (2) - 8 freq annone (2) - 1 freq outdone (2) - 1 freq ‘done (2) - 1 freq €˜done (2) - 1 freq 'done (2) - 4 freq done (2) - 821 freq none (2) - 57 freq undoin (2) - 1 freq condone (2) - 1 freq unholy (3) - 4 freq sundouns (3) - 7 freq |
undone (0) - 4 freq undon (1) - 1 freq undoan (2) - 2 freq undoin (2) - 1 freq condone (3) - 1 freq 'done (3) - 4 freq unduin (3) - 1 freq undaen (3) - 1 freq done (3) - 821 freq undain (3) - 1 freq endan (3) - 2 freq ndna (3) - 8 freq undeun (3) - 1 freq outdone (3) - 1 freq indiane (3) - 1 freq none (3) - 57 freq annone (3) - 1 freq endin (3) - 43 freq mundane (3) - 5 freq ndaoine (3) - 1 freq undae (3) - 3 freq lundon (3) - 2 freq anyone (3) - 67 freq onyone (3) - 23 freq undo (3) - 1 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 |
UNDONE |
| Time to execute Levenshtein function - 0.179589 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.340940 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.028092 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.038128 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.000866 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. |