| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| appens (0) - 5 freq appent (1) - 7 freq apens (1) - 7 freq wappens (1) - 6 freq happens (1) - 204 freq append (1) - 2 freq appense (1) - 1 freq oppens (1) - 4 freq appen (1) - 25 freq aliens (2) - 5 freq apps (2) - 5 freq appert (2) - 1 freq appeir (2) - 1 freq lippens (2) - 24 freq apes (2) - 4 freq paens (2) - 1 freq affens (2) - 8 freq 'appen (2) - 1 freq tappins (2) - 1 freq appenin (2) - 3 freq appenan (2) - 3 freq apen (2) - 70 freq afens (2) - 2 freq happins (2) - 3 freq lappers (2) - 1 freq |
appens (0) - 5 freq appense (1) - 1 freq oppens (1) - 4 freq appen (2) - 25 freq append (2) - 2 freq yappins (2) - 1 freq happens (2) - 204 freq appent (2) - 7 freq apens (2) - 7 freq wappens (2) - 6 freq apples (3) - 10 freq applees (3) - 3 freq yappen (3) - 5 freq peens (3) - 6 freq oppen (3) - 31 freq wappons (3) - 6 freq appeals (3) - 4 freq ripens (3) - 2 freq spens (3) - 7 freq 'pens (3) - 1 freq haippens (3) - 2 freq plens (3) - 17 freq tuppens (3) - 1 freq appynt (3) - 4 freq appin (3) - 2 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 - APNS apens - 7 freq appens - 5 freq apenness - 2 freq appense - 1 freq |
APPENS |
| Time to execute Levenshtein function - 0.466827 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.810149 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.076215 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.036869 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.000808 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. |