| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| anymare (0) - 17 freq onymare (1) - 2 freq anymaire (1) - 11 freq anymore (1) - 14 freq anymair (2) - 33 freq animate (2) - 1 freq annmari (2) - 2 freq aname (3) - 1 freq anyways (3) - 12 freq anytime (3) - 29 freq anae (3) - 1 freq €˜mare (3) - 2 freq snare (3) - 13 freq onysake (3) - 1 freq anya (3) - 1 freq neymar (3) - 1 freq tyare (3) - 1 freq onymair (3) - 38 freq animacy (3) - 1 freq unmade (3) - 5 freq alomar (3) - 1 freq ganymede (3) - 1 freq animal (3) - 101 freq y'are (3) - 3 freq anyday (3) - 3 freq |
anymare (0) - 17 freq anymaire (1) - 11 freq anymore (1) - 14 freq onymare (1) - 2 freq anymair (2) - 33 freq neymar (3) - 1 freq onymair (3) - 38 freq animate (3) - 1 freq annmari (3) - 2 freq annemar (4) - 1 freq unaware (4) - 6 freq noymarp (4) - 1 freq notare (4) - 1 freq admire (4) - 32 freq andrae (4) - 7 freq amyire (4) - 1 freq anhere (4) - 1 freq amara (4) - 1 freq onyman (4) - 1 freq namer (4) - 1 freq numero (4) - 1 freq amore (4) - 1 freq ianuare (4) - 1 freq ansar (4) - 1 freq anar (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 |
ANYMARE |
| Time to execute Levenshtein function - 0.199279 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.352124 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.027451 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.037054 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.000898 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. |