| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| affens (0) - 8 freq affen (1) - 118 freq afens (1) - 2 freq gaffers (2) - 2 freq offees (2) - 1 freq oftens (2) - 1 freq affecks (2) - 6 freq attens (2) - 1 freq affere (2) - 1 freq saftens (2) - 3 freq apens (2) - 7 freq affer (2) - 2 freq saffen (2) - 1 freq offen (2) - 17 freq afters (2) - 3 freq offers (2) - 67 freq iffen (2) - 4 freq aften (2) - 345 freq alfenus (2) - 1 freq afen (2) - 4 freq affects (2) - 10 freq aliens (2) - 5 freq effeks (2) - 1 freq athens (2) - 17 freq fens (2) - 3 freq |
affens (0) - 8 freq offense (2) - 1 freq afens (2) - 2 freq affen (2) - 118 freq fens (3) - 3 freq effeks (3) - 1 freq iffen (3) - 4 freq oaffers (3) - 1 freq offess (3) - 1 freq offends (3) - 1 freq affs (3) - 4 freq offend (3) - 12 freq daffins (3) - 1 freq offers (3) - 67 freq affin (3) - 2 freq alfenus (3) - 1 freq offees (3) - 1 freq oftens (3) - 1 freq offen (3) - 17 freq affairs (4) - 42 freq ffs (4) - 152 freq freins (4) - 45 freq offence (4) - 35 freq farns (4) - 2 freq fons (4) - 1 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.188719 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.373694 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.027144 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.037461 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.000935 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. |