| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| anlie (0) - 15 freq ainlie (1) - 138 freq anelie (1) - 25 freq allie (1) - 9 freq alie (1) - 1 freq andie (1) - 1 freq ailie (1) - 1 freq aalie (1) - 1 freq annie (1) - 108 freq angie (1) - 36 freq onlie (1) - 102 freq mankie (2) - 6 freq absie (2) - 1 freq sannie (2) - 6 freq onie (2) - 778 freq ailin (2) - 2 freq ilie (2) - 1 freq unlik (2) - 1 freq lallie (2) - 1 freq lonlie (2) - 1 freq anerlie (2) - 68 freq antit (2) - 1 freq bannie (2) - 1 freq airlie (2) - 47 freq aale (2) - 1 freq |
anlie (0) - 15 freq onlie (1) - 102 freq anelie (1) - 25 freq ainlie (1) - 138 freq onlee (2) - 2 freq ainle (2) - 2 freq nle (2) - 1 freq angie (2) - 36 freq anly (2) - 1 freq onli (2) - 40 freq andie (2) - 1 freq annie (2) - 108 freq ailie (2) - 1 freq allie (2) - 9 freq alie (2) - 1 freq aalie (2) - 1 freq ainly (3) - 231 freq canle (3) - 2 freq dulie (3) - 1 freq fylie (3) - 16 freq mailie (3) - 3 freq indie (3) - 1 freq anbile (3) - 1 freq anee (3) - 1 freq halie (3) - 83 freq |
SoundEx code - A540 ainly - 231 freq anelie - 25 freq an'll - 2 freq anely - 328 freq ainlie - 138 freq 'ainly - 3 freq annual - 24 freq amyl - 1 freq amly - 1 freq anneal - 2 freq ainly' - 1 freq an'wul - 1 freq anlie - 15 freq ainle - 2 freq anly - 1 freq amelia - 1 freq aenly - 1 freq amyelle - 2 freq anawl - 1 freq anal - 1 freq aimeelou - 4 freq |
MetaPhone code - ANL ainly - 231 freq anelie - 25 freq an'll - 2 freq anely - 328 freq ainlie - 138 freq 'ainly - 3 freq annual - 24 freq anneal - 2 freq ainly' - 1 freq anlie - 15 freq ainle - 2 freq anly - 1 freq anawl - 1 freq anal - 1 freq |
ANLIE |
| Time to execute Levenshtein function - 0.198039 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.358600 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.027635 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.037020 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.000865 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. |