| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| avenger (0) - 1 freq avenged (1) - 3 freq avenge (1) - 11 freq avengers (1) - 2 freq avenue (2) - 19 freq reenger (2) - 1 freq avever (2) - 1 freq venge (2) - 1 freq feenger (2) - 1 freq avengit (2) - 2 freq aventur (2) - 3 freq avengin (2) - 1 freq veneer (2) - 1 freq scavenger (2) - 2 freq lavender (2) - 57 freq ainger (2) - 3 freq anger (2) - 73 freq avenues (2) - 5 freq teenge (3) - 3 freq reengers (3) - 2 freq yunger (3) - 11 freq 'teeger (3) - 8 freq salinger (3) - 1 freq chenge (3) - 11 freq denier (3) - 1 freq |
avenger (0) - 1 freq avenged (2) - 3 freq avengers (2) - 2 freq avenge (2) - 11 freq aventur (3) - 3 freq avengin (3) - 1 freq avengit (3) - 2 freq anger (3) - 73 freq ainger (3) - 3 freq veneer (3) - 1 freq reenger (3) - 1 freq venge (3) - 1 freq feenger (3) - 1 freq longer (4) - 72 freq oranger (4) - 1 freq dinger (4) - 17 freq ganger (4) - 1 freq hunger (4) - 50 freq finger (4) - 202 freq voger (4) - 1 freq vengin (4) - 1 freq veenegar (4) - 1 freq linger (4) - 5 freq singer (4) - 47 freq sanger (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 - AFNJR avenger - 1 freq |
AVENGER |
| Time to execute Levenshtein function - 0.219158 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.354337 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.027708 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.038298 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.000959 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. |