Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
upd (0) - 1 freq mpd (1) - 1 freq apd (1) - 2 freq upx (1) - 1 freq ud (1) - 4 freq upt (1) - 2 freq upa (1) - 2 freq usd (1) - 1 freq up (1) - 12983 freq upo (1) - 67 freq uid (1) - 1 freq upn (1) - 1 freq cpd (1) - 3 freq utd (1) - 11 freq ups (1) - 22 freq up' (1) - 5 freq pd (1) - 2 freq dpd (1) - 1 freq npd (1) - 1 freq und (1) - 12 freq upr (1) - 2 freq updo (1) - 1 freq csd (2) - 11 freq hd (2) - 4 freq spk (2) - 1 freq |
upd (0) - 1 freq updo (1) - 1 freq apd (1) - 2 freq pd (1) - 2 freq oped (2) - 1 freq und (2) - 12 freq npd (2) - 1 freq ped (2) - 2 freq upr (2) - 2 freq ipad (2) - 6 freq puid (2) - 1 freq ipod (2) - 3 freq pid (2) - 1 freq pad (2) - 56 freq dpd (2) - 1 freq pud (2) - 3 freq pod (2) - 11 freq pued (2) - 25 freq usd (2) - 1 freq up (2) - 12983 freq upa (2) - 2 freq up' (2) - 5 freq upx (2) - 1 freq upn (2) - 1 freq ud (2) - 4 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 |
UPD |
Time to execute Levenshtein function - 0.190804 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.348494 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.027748 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.036539 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.000846 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. |