| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| avenge (0) - 11 freq venge (1) - 1 freq avenged (1) - 3 freq avenger (1) - 1 freq avenue (1) - 19 freq verge (2) - 9 freq veage (2) - 9 freq abene (2) - 1 freq veige (2) - 2 freq average (2) - 28 freq arenae (2) - 83 freq reenge (2) - 60 freq peenge (2) - 7 freq avengin (2) - 1 freq venue (2) - 14 freq chenge (2) - 11 freq teenge (2) - 3 freq averse (2) - 6 freq beenge (2) - 1 freq aedge (2) - 8 freq ange (2) - 1 freq avengers (2) - 2 freq raenge (2) - 1 freq aence (2) - 8 freq havenae (2) - 20 freq |
avenge (0) - 11 freq venge (1) - 1 freq avenger (2) - 1 freq avenue (2) - 19 freq avenged (2) - 3 freq ange (3) - 1 freq beenge (3) - 1 freq teenge (3) - 3 freq raenge (3) - 1 freq avengit (3) - 2 freq avenues (3) - 5 freq venue (3) - 14 freq orenge (3) - 2 freq revenge (3) - 23 freq verge (3) - 9 freq veage (3) - 9 freq veige (3) - 2 freq average (3) - 28 freq avengin (3) - 1 freq peenge (3) - 7 freq reenge (3) - 60 freq asang (4) - 1 freq teng (4) - 1 freq veggie (4) - 15 freq range (4) - 93 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 - AFNJ avenge - 11 freq |
AVENGE |
| Time to execute Levenshtein function - 0.185627 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.323673 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.026793 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.036736 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.000845 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. |