| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| affens (0) - 8 freq afens (1) - 2 freq affen (1) - 118 freq affs (2) - 4 freq attens (2) - 1 freq afen (2) - 4 freq daffins (2) - 1 freq iffen (2) - 4 freq apens (2) - 7 freq saffen (2) - 1 freq affecks (2) - 6 freq 'affen' (2) - 1 freq affects (2) - 9 freq aff'n (2) - 1 freq affeir (2) - 1 freq affin (2) - 2 freq offense (2) - 1 freq offess (2) - 1 freq athens (2) - 17 freq offees (2) - 1 freq fens (2) - 3 freq aliens (2) - 5 freq saftens (2) - 3 freq haffets (2) - 6 freq oftens (2) - 1 freq |
affens (0) - 8 freq affen (2) - 118 freq offense (2) - 1 freq afens (2) - 2 freq oftens (3) - 1 freq fens (3) - 3 freq offess (3) - 1 freq effeks (3) - 1 freq offees (3) - 1 freq offends (3) - 1 freq offend (3) - 12 freq oaffers (3) - 1 freq alfenus (3) - 1 freq affin (3) - 2 freq offers (3) - 59 freq offen (3) - 17 freq affs (3) - 4 freq daffins (3) - 1 freq iffen (3) - 4 freq flans (4) - 3 freq affairs (4) - 41 freq sofans (4) - 1 freq fifers (4) - 8 freq sauffins (4) - 1 freq fins (4) - 35 freq |
SoundEx code - A152 apens - 7 freq abeyance - 1 freq avenge - 11 freq avenues - 5 freq affeomes - 1 freq appens - 5 freq apenness - 2 freq affens - 8 freq avengit - 2 freq avenged - 3 freq avengin - 1 freq avenger - 1 freq abins - 1 freq aff-fawins - 2 freq avengers - 2 freq appunct - 1 freq appense - 1 freq afens - 2 freq appen-access - 1 freq |
MetaPhone code - AFNS avenues - 5 freq affens - 8 freq afens - 2 freq |
AFFENS |
| Time to execute Levenshtein function - 0.210980 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.438052 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.031414 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.039277 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.000801 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. |