| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| affluence (0) - 1 freq influence (2) - 77 freq affluent (2) - 5 freq enfluenced (3) - 1 freq aff-licence (3) - 1 freq influences (3) - 22 freq effluent (3) - 1 freq fluency (3) - 7 freq offence (3) - 35 freq flunce (3) - 1 freq confluence (3) - 3 freq affline (3) - 2 freq influenced (3) - 16 freq affect (4) - 10 freq aff-centre (4) - 1 freq feruencie (4) - 2 freq aff-chance (4) - 1 freq avidence (4) - 2 freq seilence (4) - 6 freq fluent (4) - 22 freq flench (4) - 2 freq affen (4) - 118 freq defence (4) - 46 freq offece (4) - 1 freq inference (4) - 2 freq |
affluence (0) - 1 freq influence (3) - 77 freq affluent (3) - 5 freq fluency (4) - 7 freq offence (4) - 35 freq effluent (4) - 1 freq flunce (4) - 1 freq affline (4) - 2 freq influenced (5) - 16 freq offince (5) - 1 freq offline (5) - 1 freq confluence (5) - 3 freq aff-licence (5) - 1 freq enfluenced (5) - 1 freq influences (5) - 22 freq diffrence (6) - 10 freq frunce (6) - 1 freq tafelente (6) - 1 freq affens (6) - 8 freq scilence (6) - 1 freq flense (6) - 1 freq seelence (6) - 73 freq reference (6) - 52 freq offences (6) - 2 freq influenza (6) - 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 - AFLNS affluence - 1 freq |
AFFLUENCE |
| Time to execute Levenshtein function - 0.194227 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.366810 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.027872 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.037768 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.000927 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. |