| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| upload (0) - 2 freq unload (1) - 3 freq uploads (1) - 1 freq load (2) - 134 freq uplaid (2) - 1 freq uplan (2) - 4 freq uphaad (2) - 1 freq uphold (2) - 1 freq expload (2) - 1 freq ploat (2) - 1 freq upoan (2) - 7 freq uploadin (2) - 1 freq uploaded (2) - 1 freq plood (2) - 1 freq upland (2) - 5 freq plead (2) - 6 freq plod (2) - 1 freq uproar (2) - 8 freq 'loab (3) - 1 freq goad (3) - 105 freq lord (3) - 404 freq plong (3) - 10 freq upward (3) - 5 freq 'lord (3) - 8 freq unloadin (3) - 6 freq |
upload (0) - 2 freq plood (2) - 1 freq plead (2) - 6 freq uplaid (2) - 1 freq plod (2) - 1 freq uploads (2) - 1 freq unload (2) - 3 freq plied (3) - 13 freq ploued (3) - 4 freq pled (3) - 3 freq uplan (3) - 4 freq playd (3) - 2 freq plooed (3) - 10 freq plaid (3) - 23 freq load (3) - 134 freq expload (3) - 1 freq uphold (3) - 1 freq uphaad (3) - 1 freq ploat (3) - 1 freq ploied (3) - 1 freq uploaded (3) - 1 freq uploadin (3) - 1 freq upland (3) - 5 freq flood (4) - 24 freq plae (4) - 1 freq |
SoundEx code - U143 upheld - 6 freq upholds - 1 freq uploaded - 1 freq uploadin - 1 freq uplaid - 1 freq uphold - 1 freq up-plewit - 1 freq uphauld - 1 freq uploads - 1 freq upload - 2 freq |
MetaPhone code - UPLT uplaid - 1 freq upload - 2 freq |
UPLOAD |
| Time to execute Levenshtein function - 0.239346 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.519420 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.063313 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.037639 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.000957 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. |