| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ainly (0) - 231 freq anly (1) - 1 freq ainly' (1) - 1 freq vainly (1) - 3 freq fainly (1) - 2 freq airly (1) - 20 freq aenly (1) - 1 freq wainly (1) - 1 freq 'ainly (1) - 3 freq mainly (1) - 40 freq ainle (1) - 2 freq aznly (1) - 1 freq annoy (2) - 12 freq plainly (2) - 9 freq thinly (2) - 2 freq kindly (2) - 48 freq aines (2) - 2 freq fonly (2) - 1 freq nairly (2) - 1 freq aidle (2) - 1 freq winky (2) - 7 freq dilly (2) - 1 freq incy (2) - 1 freq aply (2) - 2 freq aikey (2) - 4 freq |
ainly (0) - 231 freq aenly (1) - 1 freq anly (1) - 1 freq ainle (1) - 2 freq oanly (2) - 7 freq aznly (2) - 1 freq inla (2) - 1 freq anely (2) - 323 freq only (2) - 1847 freq ainlie (2) - 116 freq mainly (2) - 40 freq vainly (2) - 3 freq airly (2) - 20 freq wainly (2) - 1 freq ainly' (2) - 1 freq 'ainly (2) - 3 freq fainly (2) - 2 freq aigle (3) - 4 freq hiely (3) - 1 freq amly (3) - 1 freq anlie (3) - 15 freq ainerly (3) - 2 freq mily (3) - 2 freq insy (3) - 4 freq nile (3) - 14 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 |
AINLY |
| Time to execute Levenshtein function - 0.222459 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.347157 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.028478 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.037744 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.000842 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. |