| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| applying (0) - 8 freq applyin (1) - 5 freq implying (2) - 1 freq appalling (2) - 2 freq replying (2) - 3 freq applyit (2) - 1 freq employing (3) - 1 freq replyin (3) - 9 freq happing (3) - 1 freq appearing (3) - 5 freq opposing (3) - 2 freq aspiring (3) - 1 freq complying (3) - 1 freq spalding (3) - 2 freq pulsing (3) - 3 freq poling (3) - 1 freq spelling (3) - 72 freq plyin (3) - 1 freq appoint (3) - 2 freq yapping (3) - 5 freq playing (3) - 51 freq applied (3) - 27 freq lying (3) - 24 freq appallin (3) - 2 freq annoying (3) - 8 freq |
applying (0) - 8 freq applyin (2) - 5 freq appealing (3) - 1 freq replying (3) - 3 freq implying (3) - 1 freq appalling (3) - 2 freq sapling (4) - 2 freq playing (4) - 51 freq polling (4) - 3 freq piling (4) - 1 freq pulling (4) - 11 freq pilling (4) - 1 freq yapping (4) - 5 freq toppling (4) - 1 freq kipling (4) - 3 freq appliein (4) - 2 freq rippling (4) - 1 freq appearing (4) - 5 freq employing (4) - 1 freq opposing (4) - 2 freq applyit (4) - 1 freq poling (4) - 1 freq implyin (5) - 3 freq appenin (5) - 3 freq applyet (5) - 1 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 - APLYNK applying - 8 freq |
APPLYING |
| Time to execute Levenshtein function - 0.221134 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.381435 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.029068 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.037922 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.000847 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. |