Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ainle (0) - 2 freq aible (1) - 2 freq aiple (1) - 5 freq aince (1) - 459 freq ainly (1) - 231 freq ainee (1) - 1 freq aine (1) - 4 freq aigle (1) - 4 freq aidle (1) - 1 freq aizle (1) - 1 freq ainkle (1) - 1 freq ainlie (1) - 138 freq aisle (1) - 27 freq rile (2) - 3 freq line (2) - 497 freq dinae (2) - 40 freq hannle (2) - 5 freq title (2) - 65 freq minne (2) - 3 freq ailie (2) - 1 freq anae (2) - 1 freq mince (2) - 109 freq inte (2) - 129 freq eine (2) - 1 freq ains (2) - 15 freq |
ainle (0) - 2 freq ainly (1) - 231 freq ainlie (1) - 138 freq inla (2) - 1 freq aible (2) - 2 freq aince (2) - 459 freq anlie (2) - 15 freq aenly (2) - 1 freq nle (2) - 1 freq nile (2) - 14 freq aisle (2) - 27 freq anly (2) - 1 freq aiple (2) - 5 freq aine (2) - 4 freq aigle (2) - 4 freq aidle (2) - 1 freq ainkle (2) - 1 freq aizle (2) - 1 freq ainee (2) - 1 freq yince (3) - 391 freq anee (3) - 1 freq isle (3) - 85 freq neale (3) - 1 freq ained (3) - 19 freq nila (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 |
AINLE |
Time to execute Levenshtein function - 0.184749 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.369328 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.037231 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.049765 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.001205 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. |