| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| anymore (0) - 14 freq anymare (1) - 17 freq anymaire (2) - 11 freq anyone (2) - 67 freq onymare (2) - 2 freq achmore (2) - 1 freq amore (2) - 1 freq anyroad (3) - 7 freq marmore (3) - 2 freq anhere (3) - 1 freq incore (3) - 2 freq anywhere (3) - 33 freq atore (3) - 2 freq anyont (3) - 1 freq amor (3) - 1 freq oanyone (3) - 1 freq anybody (3) - 74 freq admire (3) - 32 freq anchors (3) - 1 freq anchort (3) - 3 freq yore (3) - 4 freq dinsmore (3) - 2 freq aname (3) - 1 freq dromore (3) - 1 freq amyoose (3) - 1 freq |
anymore (0) - 14 freq anymare (1) - 17 freq onymare (2) - 2 freq anymaire (2) - 11 freq amore (3) - 1 freq anymair (3) - 33 freq numero (4) - 1 freq more (4) - 465 freq onymair (4) - 38 freq encore (4) - 5 freq aname (4) - 1 freq airmor (4) - 1 freq admire (4) - 32 freq annmari (4) - 2 freq memore (4) - 3 freq kenmore (4) - 1 freq animate (4) - 1 freq anhere (4) - 1 freq smore (4) - 7 freq achmore (4) - 1 freq anyone (4) - 67 freq incore (4) - 2 freq namer (4) - 1 freq anomoly (4) - 1 freq amor (4) - 1 freq |
SoundEx code - A556 anymair - 33 freq anymare - 17 freq anymore - 14 freq anymaire - 11 freq anunner - 1 freq annemarieneary - 1 freq annemar - 1 freq annemariedehaan - 1 freq annamorozova - 1 freq |
MetaPhone code - ANMR anymair - 33 freq anymare - 17 freq anymore - 14 freq anymaire - 11 freq annemar - 1 freq annmari - 2 freq |
ANYMORE |
| Time to execute Levenshtein function - 0.395973 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.719999 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.078389 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.041089 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.000937 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. |