| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| appealin (0) - 6 freq appearin (1) - 22 freq appeelin (1) - 1 freq appealing (1) - 1 freq appearit (2) - 5 freq appellit (2) - 1 freq appallin (2) - 2 freq appeals (2) - 4 freq appealed (2) - 7 freq appearing (2) - 5 freq apprasin (2) - 1 freq appeal (2) - 37 freq appenin (2) - 3 freq appearan (2) - 2 freq bealin (3) - 32 freq a-tearin (3) - 1 freq peelin (3) - 5 freq spreadin (3) - 32 freq upwellin (3) - 1 freq stealin (3) - 35 freq 'stealin (3) - 1 freq speelin (3) - 5 freq adrenalin (3) - 4 freq pedlin (3) - 1 freq speilin (3) - 1 freq |
appealin (0) - 6 freq appeelin (1) - 1 freq appearin (2) - 22 freq appealing (2) - 1 freq appeal (3) - 37 freq appliein (3) - 2 freq appearan (3) - 2 freq applyin (3) - 5 freq appenin (3) - 3 freq appeals (3) - 4 freq appealed (3) - 7 freq appallin (3) - 2 freq appen (4) - 25 freq speilin (4) - 1 freq pedlin (4) - 1 freq palin (4) - 4 freq spielin (4) - 1 freq pipeline (4) - 3 freq applaudin (4) - 4 freq appin (4) - 2 freq papplin (4) - 2 freq peelin (4) - 5 freq apprasin (4) - 1 freq appearing (4) - 5 freq appellit (4) - 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 - APLN appeelin - 1 freq appealin - 6 freq appliein - 2 freq appallin - 2 freq |
APPEALIN |
| Time to execute Levenshtein function - 0.388129 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.675571 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.030882 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.058693 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.000809 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. |