| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| undo (0) - 1 freq unto (1) - 8 freq ando (1) - 1 freq undr (1) - 1 freq undon (1) - 1 freq updo (1) - 1 freq uydo (1) - 1 freq unyo (1) - 1 freq und (1) - 12 freq unco (1) - 328 freq uno (1) - 1 freq uneo (1) - 1 freq ndr (2) - 1 freq undur (2) - 2 freq todo (2) - 1 freq 'no (2) - 89 freq 'unco (2) - 2 freq bunno (2) - 1 freq aund (2) - 2 freq fundy (2) - 1 freq lando (2) - 1 freq dnd (2) - 1 freq mondo (2) - 2 freq ino (2) - 2 freq cnd (2) - 8 freq |
undo (0) - 1 freq ando (1) - 1 freq und (1) - 12 freq undae (2) - 3 freq ende (2) - 3 freq inde (2) - 4 freq endy (2) - 8 freq andy (2) - 151 freq and (2) - 25387 freq end (2) - 1221 freq nd (2) - 88 freq enda (2) - 2 freq ond (2) - 1 freq indy (2) - 57 freq inda (2) - 1 freq aund (2) - 2 freq ande (2) - 4 freq unco (2) - 328 freq uno (2) - 1 freq uneo (2) - 1 freq undr (2) - 1 freq undon (2) - 1 freq unto (2) - 8 freq updo (2) - 1 freq unyo (2) - 1 freq |
SoundEx code - U530 unmet - 3 freq unity - 45 freq unto - 8 freq untae - 13 freq unty - 4 freq unite - 11 freq unit - 42 freq unmade - 5 freq undae - 3 freq um-eet - 1 freq untie - 2 freq unwed - 1 freq und - 12 freq unmeet - 1 freq unyt - 7 freq €™und - 1 freq undo - 1 freq uinitie - 1 freq untee - 1 freq unt - 1 freq |
MetaPhone code - UNT unity - 45 freq unto - 8 freq untae - 13 freq unty - 4 freq unite - 11 freq unit - 42 freq undae - 3 freq untie - 2 freq und - 12 freq unyt - 7 freq €™und - 1 freq undo - 1 freq uinitie - 1 freq untee - 1 freq unt - 1 freq |
UNDO |
| Time to execute Levenshtein function - 0.289911 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.591052 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.027634 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.068494 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.000873 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. |