Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
anelie (0) - 25 freq lanelie (1) - 1 freq anerlie (1) - 68 freq anlie (1) - 15 freq aniline (2) - 9 freq amelia (2) - 1 freq aalie (2) - 1 freq nellie (2) - 42 freq anely (2) - 323 freq belie (2) - 2 freq aweliy (2) - 1 freq annelid (2) - 1 freq angle (2) - 21 freq ailie (2) - 1 freq aedie (2) - 1 freq eelie (2) - 1 freq lanerlie (2) - 2 freq keelie (2) - 7 freq adele (2) - 1 freq raelie (2) - 3 freq anglin (2) - 2 freq heelie (2) - 3 freq angelic (2) - 9 freq fanklie (2) - 1 freq kinelie (2) - 1 freq |
anelie (0) - 25 freq anlie (1) - 15 freq onlie (2) - 102 freq ainlie (2) - 116 freq anely (2) - 323 freq lanelie (2) - 1 freq anerlie (2) - 68 freq anee (3) - 1 freq andie (3) - 1 freq anemia (3) - 1 freq aillie (3) - 1 freq ainerlie (3) - 2 freq alie (3) - 1 freq peelie (3) - 9 freq airlie (3) - 47 freq annie (3) - 107 freq weelie (3) - 3 freq namelie (3) - 3 freq angie (3) - 36 freq onli (3) - 40 freq nle (3) - 1 freq nile (3) - 14 freq ainle (3) - 2 freq neale (3) - 1 freq anal (3) - 1 freq |
SoundEx code - A540 ainly - 231 freq anelie - 25 freq an'll - 2 freq anely - 323 freq ainlie - 116 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 - 323 freq ainlie - 116 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 |
ANELIE |
Time to execute Levenshtein function - 0.206479 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.371846 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.037460 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.039862 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.000830 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. |