| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| affaloon (0) - 2 freq falcon (3) - 4 freq saloon (3) - 1 freq mcaloon (3) - 2 freq fitaloon (3) - 1 freq affload (3) - 1 freq macaloon (3) - 1 freq orraloon (3) - 6 freq affection (4) - 24 freq calton (4) - 10 freq balloon (4) - 37 freq loon (4) - 669 freq a'aboot (4) - 1 freq felon (4) - 2 freq galoot (4) - 8 freq baboon (4) - 1 freq aff'n (4) - 1 freq fallin (4) - 48 freq foon (4) - 7 freq affatr (4) - 1 freq falloe (4) - 1 freq i'loon (4) - 1 freq dragoon (4) - 1 freq felloot (4) - 1 freq awtroon (4) - 26 freq |
affaloon (0) - 2 freq affline (4) - 2 freq fitaloon (4) - 1 freq affload (4) - 1 freq follooin (5) - 6 freq foalin (5) - 1 freq affin (5) - 2 freq fallen (5) - 29 freq affgaun (5) - 1 freq offline (5) - 1 freq wafflin (5) - 2 freq affhan (5) - 1 freq affen (5) - 118 freq bafflin (5) - 1 freq affil (5) - 7 freq fallan (5) - 4 freq offal (5) - 2 freq faalan (5) - 4 freq teflon (5) - 2 freq offairin (5) - 1 freq orraloon (5) - 6 freq affeirin (5) - 1 freq affhaun (5) - 1 freq macaloon (5) - 1 freq mcaloon (5) - 2 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 - AFLN affline - 2 freq affaloon - 2 freq |
AFFALOON |
| Time to execute Levenshtein function - 0.341582 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.842289 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.030896 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.090285 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.001177 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. |