| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| updo (0) - 1 freq upd (1) - 1 freq undo (1) - 1 freq upo (1) - 67 freq uydo (1) - 1 freq irpdo (2) - 1 freq upÂ… (2) - 1 freq uao (2) - 1 freq ups (2) - 22 freq ipo (2) - 56 freq lydo (2) - 2 freq fado (2) - 1 freq upö (2) - 1 freq murdo (2) - 18 freq uuno (2) - 1 freq apd (2) - 2 freq up's (2) - 2 freq ydo (2) - 1 freq todo (2) - 1 freq pdf (2) - 37 freq up (2) - 12983 freq po (2) - 21 freq €˜do (2) - 4 freq dado (2) - 1 freq judo (2) - 2 freq |
updo (0) - 1 freq upd (1) - 1 freq uydo (2) - 1 freq pd (2) - 2 freq apd (2) - 2 freq undo (2) - 1 freq upo (2) - 67 freq poo (3) - 18 freq up-a (3) - 1 freq cpd (3) - 3 freq npd (3) - 1 freq upun (3) - 5 freq utd (3) - 11 freq pada (3) - 1 freq upr (3) - 2 freq uid (3) - 1 freq aldo (3) - 266 freq ando (3) - 1 freq upn (3) - 1 freq dpd (3) - 1 freq ipso (3) - 2 freq pro (3) - 11 freq wido (3) - 2 freq do (3) - 837 freq up' (3) - 5 freq |
SoundEx code - U130 uptae - 19 freq upped - 5 freq upwide - 1 freq uphaud - 121 freq upbeat - 4 freq up't - 1 freq uppity - 6 freq upt - 2 freq upo't - 1 freq up-pit - 1 freq updo - 1 freq upheid - 1 freq uphaad - 1 freq u-bait - 1 freq uppt - 1 freq upwith - 1 freq up-the - 1 freq up-the-wey - 1 freq upd - 1 freq ueabd - 1 freq |
MetaPhone code - UPT uptae - 19 freq upped - 5 freq up't - 1 freq uppity - 6 freq upt - 2 freq upo't - 1 freq updo - 1 freq uppt - 1 freq upd - 1 freq |
UPDO |
| Time to execute Levenshtein function - 0.180487 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.354537 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.028191 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.037808 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.000875 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. |