| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| appleby (0) - 2 freq appeleby (1) - 1 freq applee (2) - 1 freq apples (2) - 10 freq applees (2) - 3 freq apoplexy (2) - 1 freq apply (2) - 37 freq apple (2) - 30 freq sappled (3) - 3 freq applies (3) - 17 freq applyet (3) - 1 freq ackley (3) - 1 freq aipple (3) - 102 freq plebs (3) - 5 freq appliein (3) - 2 freq appent (3) - 7 freq aplenty (3) - 6 freq piley (3) - 1 freq applied (3) - 27 freq epples (3) - 10 freq spaley (3) - 3 freq ashley (3) - 10 freq appear (3) - 98 freq alley (3) - 4 freq pleb (3) - 4 freq |
appleby (0) - 2 freq appeleby (1) - 1 freq apply (3) - 37 freq apoplexy (3) - 1 freq apple (3) - 30 freq applees (3) - 3 freq applee (3) - 1 freq apples (3) - 10 freq aipples (4) - 91 freq applyit (4) - 1 freq pleb (4) - 4 freq applaud (4) - 4 freq applyin (4) - 5 freq applied (4) - 27 freq appeal (4) - 37 freq epple (4) - 13 freq epples (4) - 10 freq aipple (4) - 102 freq applies (4) - 17 freq appliein (4) - 2 freq applyet (4) - 1 freq appeelin (5) - 1 freq dappled (5) - 4 freq append (5) - 2 freq appealed (5) - 7 freq |
SoundEx code - A141 aipple-boxes - 1 freq available - 128 freq availabil - 1 freq aplift - 1 freq able-bodied - 2 freq avaelable - 2 freq availability - 5 freq auobalba - 13 freq appleby - 2 freq appeleby - 1 freq abailable - 1 freq 'available - 1 freq |
MetaPhone code - APLB appleby - 2 freq appeleby - 1 freq |
APPLEBY |
| Time to execute Levenshtein function - 0.213974 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.384890 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.028816 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.039659 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.000932 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. |