| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uppity (0) - 6 freq huppity (1) - 1 freq peity (2) - 4 freq upwith (2) - 1 freq whuppity (2) - 6 freq up-pit (2) - 1 freq unity (2) - 45 freq uppt (2) - 1 freq cuppit (2) - 3 freq prity (2) - 2 freq wuppit (2) - 3 freq uppin (2) - 1 freq suppit (2) - 10 freq pity (2) - 44 freq appt (3) - 1 freq nippit (3) - 43 freq upsets (3) - 2 freq unit (3) - 42 freq parity (3) - 2 freq oppint (3) - 2 freq pitt (3) - 8 freq paisty (3) - 1 freq upper (3) - 55 freq city (3) - 288 freq dappit (3) - 1 freq |
uppity (0) - 6 freq uppt (2) - 1 freq huppity (2) - 1 freq pity (3) - 44 freq suppit (3) - 10 freq appt (3) - 1 freq pipit (3) - 6 freq pupit (3) - 1 freq wuppit (3) - 3 freq yappit (3) - 1 freq uppin (3) - 1 freq peity (3) - 4 freq cuppit (3) - 3 freq up-pit (3) - 1 freq prity (3) - 2 freq sypit (4) - 2 freq pappit (4) - 1 freq tippit (4) - 10 freq deputy (4) - 6 freq bappit (4) - 1 freq poppit (4) - 1 freq patty (4) - 3 freq hopit (4) - 6 freq upo't (4) - 1 freq piit (4) - 3 freq |
SoundEx code - U130 uptae - 22 freq upped - 5 freq upwide - 1 freq uphaud - 121 freq upbeat - 4 freq ufft - 1 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 - 22 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 |
UPPITY |
| Time to execute Levenshtein function - 0.259202 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.398508 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.029517 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.039426 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.000927 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. |