| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| amyl (0) - 1 freq a'yl (1) - 1 freq amys (1) - 1 freq amy (1) - 32 freq ayl (1) - 1 freq afyl (1) - 1 freq smyl (1) - 1 freq aiy (2) - 4 freq anyd (2) - 2 freq alya (2) - 1 freq atl (2) - 2 freq ayq (2) - 1 freq awye (2) - 13 freq my (2) - 2963 freq mql (2) - 1 freq aey (2) - 4 freq azl (2) - 1 freq awys (2) - 1 freq ayld (2) - 1 freq ahll (2) - 7 freq hwyl (2) - 1 freq awyo (2) - 1 freq ayel (2) - 2 freq any (2) - 719 freq aall (2) - 3 freq |
amyl (0) - 1 freq mal (2) - 2 freq ml (2) - 12 freq mul (2) - 2 freq a'yl (2) - 1 freq mel (2) - 4 freq myla (2) - 1 freq myle (2) - 15 freq amly (2) - 1 freq ayl (2) - 1 freq afyl (2) - 1 freq smyl (2) - 1 freq amy (2) - 32 freq amys (2) - 1 freq ail (3) - 7 freq all (3) - 1296 freq amna (3) - 15 freq mbl (3) - 1 freq amid (3) - 9 freq sayl (3) - 3 freq al (3) - 237 freq am' (3) - 1 freq tamil (3) - 1 freq myll (3) - 2 freq hayl (3) - 2 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 - AML amble - 3 freq amyl - 1 freq amly - 1 freq amelia - 1 freq aimeelou - 4 freq |
AMYL |
| Time to execute Levenshtein function - 0.163205 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.347019 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.032145 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.036613 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.000876 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. |