| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| applyin (0) - 5 freq applying (1) - 8 freq applyit (1) - 1 freq apply (2) - 37 freq appliein (2) - 2 freq papplin (2) - 2 freq appallin (2) - 2 freq supplyin (2) - 3 freq appenin (2) - 3 freq appin (2) - 2 freq applyet (2) - 1 freq implyin (2) - 3 freq replyin (2) - 9 freq plyin (2) - 1 freq complyin (3) - 1 freq applaudin (3) - 4 freq peltin (3) - 7 freq lapperin (3) - 1 freq ailin (3) - 2 freq plein (3) - 1 freq auldyin (3) - 1 freq apprasin (3) - 1 freq appealin (3) - 6 freq amplifyin (3) - 2 freq “plain (3) - 1 freq |
applyin (0) - 5 freq applyit (2) - 1 freq appliein (2) - 2 freq applying (2) - 8 freq replyin (3) - 9 freq implyin (3) - 3 freq plyin (3) - 1 freq appealin (3) - 6 freq applyet (3) - 1 freq paplin (3) - 1 freq appeelin (3) - 1 freq apply (3) - 37 freq appin (3) - 2 freq papplin (3) - 2 freq supplyin (3) - 3 freq appenin (3) - 3 freq appallin (3) - 2 freq oppin (4) - 4 freq pappin (4) - 7 freq plain (4) - 178 freq replayin (4) - 1 freq splayin (4) - 1 freq appleby (4) - 2 freq spylin (4) - 7 freq appenan (4) - 3 freq |
SoundEx code - A145 aiblins - 282 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 - APLYN applyin - 5 freq |
APPLYIN |
| Time to execute Levenshtein function - 0.213672 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.380911 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.031461 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.037249 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.000852 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. |