| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| upwith (0) - 1 freq 'with (2) - 1 freq swith (2) - 28 freq uppity (2) - 6 freq €œwith (2) - 2 freq upwind (2) - 1 freq inwith (2) - 11 freq outwith (2) - 9 freq upwide (2) - 1 freq pith (2) - 9 freq with (2) - 880 freq paith (2) - 4 freq €˜with (2) - 1 freq smith (3) - 113 freq uplifhn (3) - 1 freq rowit (3) - 1 freq sith (3) - 6 freq pitt (3) - 8 freq up-the (3) - 1 freq peth (3) - 37 freq keith (3) - 21 freq uraidh (3) - 1 freq peity (3) - 4 freq zenith (3) - 2 freq suppit (3) - 10 freq |
upwith (0) - 1 freq outwith (3) - 9 freq pith (3) - 9 freq inwith (3) - 11 freq paith (3) - 4 freq with (3) - 880 freq swith (3) - 28 freq 'with (3) - 1 freq perth (4) - 41 freq rowth (4) - 54 freq ootwith (4) - 15 freq switha (4) - 1 freq bawth (4) - 1 freq pithy (4) - 9 freq pairth (4) - 1 freq wth (4) - 1 freq woth (4) - 1 freq path (4) - 178 freq fowth (4) - 5 freq praith (4) - 1 freq wyth (4) - 1 freq waith (4) - 2 freq upwind (4) - 1 freq up-the (4) - 1 freq peth (4) - 37 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 - UPW0 upwith - 1 freq |
UPWITH |
| Time to execute Levenshtein function - 0.194898 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.334313 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.027395 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.036994 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.000893 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. |