Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
anelie (0) - 25 freq lanelie (1) - 1 freq anerlie (1) - 68 freq anlie (1) - 15 freq fanklie (2) - 1 freq adele (2) - 1 freq airlie (2) - 47 freq aniline (2) - 9 freq annie (2) - 108 freq keelie (2) - 7 freq anglice (2) - 1 freq aillie (2) - 1 freq weelie (2) - 3 freq lanerlie (2) - 2 freq andie (2) - 1 freq aesie (2) - 3 freq knelit (2) - 1 freq belie (2) - 2 freq jeelie (2) - 11 freq aalie (2) - 1 freq ainlie (2) - 138 freq annelid (2) - 1 freq peelie (2) - 9 freq nelde (2) - 3 freq enemie (2) - 7 freq |
anelie (0) - 25 freq anlie (1) - 15 freq onlie (2) - 102 freq anely (2) - 328 freq ainlie (2) - 138 freq lanelie (2) - 1 freq anerlie (2) - 68 freq aweliy (3) - 1 freq nellie (3) - 42 freq kinelie (3) - 1 freq raelie (3) - 3 freq ainerlie (3) - 2 freq ainslie (3) - 6 freq newlie (3) - 1 freq namelie (3) - 3 freq alie (3) - 1 freq elie (3) - 1 freq allie (3) - 9 freq meelie (3) - 3 freq onlee (3) - 2 freq anly (3) - 1 freq anal (3) - 1 freq neil (3) - 87 freq neale (3) - 1 freq amelia (3) - 1 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 |
ANELIE |
Time to execute Levenshtein function - 0.231990 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.390971 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.028688 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.039593 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.000912 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. |