| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| avenues (0) - 5 freq venues (1) - 19 freq avenue (1) - 19 freq avenger (2) - 1 freq aventurs (2) - 2 freq 'venus (2) - 1 freq velues (2) - 6 freq revenues (2) - 4 freq avenge (2) - 11 freq venus (2) - 32 freq venue (2) - 14 freq avengers (2) - 2 freq avenged (2) - 3 freq agonies (3) - 1 freq ravens (3) - 5 freq ensues (3) - 2 freq agencies (3) - 9 freq annies (3) - 1 freq venge (3) - 1 freq lavender (3) - 58 freq adventurs (3) - 2 freq evens (3) - 1 freq meenutes (3) - 1 freq denies (3) - 12 freq aedies (3) - 1 freq |
avenues (0) - 5 freq venues (1) - 19 freq venus (2) - 32 freq avenue (2) - 19 freq evens (3) - 1 freq vines (3) - 6 freq vanes (3) - 2 freq ovens (3) - 4 freq venue (3) - 14 freq velues (3) - 6 freq 'venus (3) - 1 freq revenues (3) - 4 freq avenge (3) - 11 freq havens (4) - 1 freq evenins (4) - 10 freq ganues (4) - 1 freq peenies (4) - 7 freq vans (4) - 22 freq ravines (4) - 1 freq ravenous (4) - 2 freq menus (4) - 3 freq veneer (4) - 1 freq genus (4) - 2 freq anes (4) - 218 freq evened (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 |
AVENUES |
| Time to execute Levenshtein function - 0.381881 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.625742 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.062606 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.039946 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.000844 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. |