| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| appealing (0) - 1 freq appearing (1) - 5 freq appealin (1) - 6 freq appalling (2) - 2 freq appeelin (2) - 1 freq appearin (2) - 22 freq appearan (3) - 2 freq spelling (3) - 72 freq speaking (3) - 29 freq appearant (3) - 3 freq revealing (3) - 2 freq dealing (3) - 8 freq spreading (3) - 8 freq appealed (3) - 7 freq appetising (3) - 1 freq appellit (3) - 1 freq repeating (3) - 2 freq appeal (3) - 37 freq pleasing (3) - 6 freq appeals (3) - 4 freq 'speaking (3) - 1 freq appallin (3) - 2 freq applying (3) - 8 freq appearit (3) - 5 freq sealing (3) - 1 freq |
appealing (0) - 1 freq appealin (2) - 6 freq appearing (2) - 5 freq applying (3) - 8 freq appalling (3) - 2 freq appeelin (3) - 1 freq appearin (4) - 22 freq kipling (5) - 3 freq applyin (5) - 5 freq yapping (5) - 5 freq poling (5) - 1 freq atheling (5) - 4 freq stealing (5) - 3 freq appraising (5) - 1 freq pipeline (5) - 3 freq pleading (5) - 1 freq appliein (5) - 2 freq sapling (5) - 2 freq piling (5) - 1 freq spoiling (5) - 3 freq pooling (5) - 1 freq polling (5) - 3 freq peeping (5) - 2 freq pilling (5) - 1 freq toppling (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 - APLNK appealing - 1 freq appalling - 2 freq |
APPEALING |
| Time to execute Levenshtein function - 0.220068 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.352147 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.027765 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.037097 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.000827 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. |