Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
amyelle (0) - 2 freq smelle (2) - 1 freq meedle (3) - 1 freq ameise (3) - 1 freq myle (3) - 15 freq amiable (3) - 1 freq yelly (3) - 12 freq amyoose (3) - 1 freq smelled (3) - 11 freq amene (3) - 1 freq namelie (3) - 3 freq abell (3) - 1 freq mylne (3) - 1 freq 'elle (3) - 1 freq smellie (3) - 1 freq helle (3) - 6 freq yella (3) - 130 freq dayell (3) - 1 freq smell (3) - 271 freq mell (3) - 23 freq meelie (3) - 3 freq ayel (3) - 2 freq amyire (3) - 1 freq gazelle (3) - 7 freq merle (3) - 5 freq |
amyelle (0) - 2 freq myll (3) - 2 freq mille (3) - 1 freq mell (3) - 23 freq mellie (3) - 2 freq mlle (3) - 1 freq smelle (3) - 1 freq smyll (4) - 2 freq mysell (4) - 2 freq merlle (4) - 1 freq yell (4) - 57 freq mellay (4) - 1 freq camille (4) - 1 freq quelle (4) - 1 freq meyle (4) - 1 freq telle (4) - 7 freq amelia (4) - 1 freq mele (4) - 1 freq smyoll (4) - 1 freq mally (4) - 1 freq millie (4) - 5 freq mall (4) - 4 freq mallae (4) - 4 freq mill (4) - 82 freq molly (4) - 10 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 - AMYL amyelle - 2 freq |
AMYELLE |
Time to execute Levenshtein function - 0.260719 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.402214 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.030982 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.040327 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.001122 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. |