| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| applemak (0) - 2 freq applees (3) - 3 freq appenan (3) - 3 freq apples (3) - 10 freq applee (3) - 1 freq appear (3) - 98 freq appeal (3) - 37 freq apple (3) - 32 freq appleby (3) - 2 freq palak (4) - 1 freq spaceman (4) - 1 freq epple (4) - 13 freq applaud (4) - 4 freq ukulemae (4) - 5 freq uswlemag (4) - 1 freq alexa (4) - 14 freq bleak (4) - 24 freq appease (4) - 8 freq napolean (4) - 2 freq approval (4) - 13 freq append (4) - 2 freq paloma (4) - 1 freq plead (4) - 6 freq apoplexy (4) - 1 freq a-plenty (4) - 4 freq |
applemak (0) - 2 freq applees (5) - 3 freq appleby (5) - 2 freq appeal (5) - 37 freq apple (5) - 32 freq applee (5) - 1 freq apples (5) - 10 freq applause (6) - 23 freq aplomb (6) - 1 freq appeals (6) - 4 freq epples (6) - 10 freq appeelin (6) - 1 freq diplomae (6) - 1 freq palma (6) - 2 freq appeleby (6) - 1 freq applied (6) - 27 freq applyet (6) - 1 freq applyin (6) - 5 freq appliein (6) - 2 freq diploma (6) - 3 freq apply (6) - 37 freq aipples (6) - 91 freq applies (6) - 17 freq applyit (6) - 1 freq epple (6) - 13 freq |
SoundEx code - A145 aiblins - 278 freq 'aiblins - 8 freq a-plenty - 4 freq aplentie - 2 freq appeelin - 1 freq a-flowin - 1 freq affluence - 1 freq applyin - 5 freq appealin - 6 freq avalanche - 7 freq abilene - 2 freq aflame - 4 freq aplenty - 6 freq abuliments - 1 freq appliances - 2 freq applying - 8 freq aiblains - 3 freq aff-limits - 2 freq affline - 2 freq aff-blawin - 1 freq appliein - 2 freq affluent - 5 freq appealing - 1 freq €œaiblins - 1 freq aplomb - 1 freq applemanyebastard - 1 freq aipplemannie - 1 freq applemak - 2 freq affaloon - 2 freq appalling - 2 freq avalonbunny - 2 freq appallin - 2 freq |
MetaPhone code - APLMK applemak - 2 freq |
APPLEMAK |
| Time to execute Levenshtein function - 0.203558 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.414776 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.028404 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.043272 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.001095 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. |