| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| upt (0) - 2 freq uppt (1) - 1 freq cpt (1) - 1 freq unt (1) - 1 freq upn (1) - 1 freq apt (1) - 45 freq upd (1) - 1 freq upo (1) - 67 freq kpt (1) - 1 freq up' (1) - 5 freq up't (1) - 1 freq up (1) - 12983 freq ept (1) - 1 freq upa (1) - 2 freq opt (1) - 2 freq upr (1) - 2 freq pt (1) - 5 freq upx (1) - 1 freq vpt (1) - 1 freq ut (1) - 9 freq ups (1) - 22 freq ul (2) - 9 freq us' (2) - 2 freq jkt (2) - 1 freq rpm (2) - 1 freq |
upt (0) - 2 freq apt (1) - 45 freq ept (1) - 1 freq opt (1) - 2 freq pt (1) - 5 freq put (2) - 544 freq ut (2) - 9 freq pat (2) - 259 freq ups (2) - 22 freq pte (2) - 4 freq pot (2) - 206 freq uptae (2) - 19 freq epty (2) - 1 freq pit (2) - 2566 freq puit (2) - 12 freq vpt (2) - 1 freq pta (2) - 1 freq pyt (2) - 2 freq pet (2) - 133 freq upd (2) - 1 freq upo (2) - 67 freq kpt (2) - 1 freq upx (2) - 1 freq unt (2) - 1 freq cpt (2) - 1 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 |
UPT |
| Time to execute Levenshtein function - 0.288597 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.575548 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.031487 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.041970 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.001060 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. |