| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| appalling (0) - 2 freq appallin (1) - 2 freq appealing (2) - 1 freq applying (2) - 8 freq spiralling (3) - 2 freq spallins (3) - 1 freq pilling (3) - 1 freq appalled (3) - 2 freq appearing (3) - 5 freq appealin (3) - 6 freq spilling (3) - 3 freq appraising (3) - 1 freq pallin (3) - 2 freq spelling (3) - 72 freq appeelin (3) - 1 freq spalding (3) - 2 freq calling (3) - 15 freq polling (3) - 3 freq falling (3) - 10 freq pulling (3) - 11 freq applyin (3) - 5 freq €œpulling (3) - 1 freq appellit (3) - 1 freq palming (3) - 1 freq pairing (4) - 2 freq |
appalling (0) - 2 freq appallin (2) - 2 freq applying (3) - 8 freq appealing (3) - 1 freq spelling (4) - 72 freq polling (4) - 3 freq spilling (4) - 3 freq pulling (4) - 11 freq pilling (4) - 1 freq applyin (5) - 5 freq falling (5) - 10 freq €œpulling (5) - 1 freq appellit (5) - 1 freq spiralling (5) - 2 freq appearing (5) - 5 freq spallins (5) - 1 freq palming (5) - 1 freq appraising (5) - 1 freq appealin (5) - 6 freq calling (5) - 15 freq pallin (5) - 2 freq appalled (5) - 2 freq spalding (5) - 2 freq appeelin (5) - 1 freq spellins (6) - 71 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 - APLNK appealing - 1 freq appalling - 2 freq |
APPALLING |
| Time to execute Levenshtein function - 0.209096 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.424968 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.031334 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.041976 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.001183 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. |