| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| appeelin (0) - 1 freq appealin (1) - 6 freq apskeelin (2) - 2 freq appellit (2) - 1 freq speelin (2) - 5 freq 'speelin (2) - 1 freq appallin (2) - 2 freq appenin (2) - 3 freq appearin (2) - 23 freq appealing (2) - 1 freq peelin (2) - 5 freq pleenin (3) - 1 freq a-seekin (3) - 1 freq peepin (3) - 6 freq deelin (3) - 1 freq apprasin (3) - 1 freq peelie (3) - 9 freq speedin (3) - 4 freq appearit (3) - 5 freq happenin (3) - 144 freq queelin (3) - 1 freq keelin (3) - 1 freq beelin (3) - 22 freq apperit (3) - 3 freq pedlin (3) - 1 freq |
appeelin (0) - 1 freq appealin (1) - 6 freq appenin (3) - 3 freq appearin (3) - 23 freq peelin (3) - 5 freq appallin (3) - 2 freq appealing (3) - 1 freq applyin (3) - 5 freq appliein (3) - 2 freq speelin (3) - 5 freq pedlin (4) - 1 freq appen (4) - 25 freq oppenin (4) - 6 freq zeppelin (4) - 2 freq pipeline (4) - 3 freq appeals (4) - 4 freq paplin (4) - 1 freq appearan (4) - 2 freq appealed (4) - 7 freq appin (4) - 2 freq spielin (4) - 1 freq appellit (4) - 1 freq speilin (4) - 1 freq appeal (4) - 37 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 - APLN appeelin - 1 freq appealin - 6 freq appliein - 2 freq appallin - 2 freq |
APPEELIN |
| Time to execute Levenshtein function - 0.178646 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.343254 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.027461 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.037478 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.000939 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. |