| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| anymair (0) - 31 freq onymair (1) - 37 freq anymaire (1) - 11 freq anywaiy (2) - 17 freq anymare (2) - 17 freq ymir (3) - 3 freq mair (3) - 6074 freq anithir (3) - 17 freq annemar (3) - 1 freq answeir (3) - 2 freq €˜mair (3) - 6 freq nair (3) - 2 freq admir (3) - 1 freq alomar (3) - 1 freq anywhar (3) - 2 freq onymare (3) - 2 freq anymore (3) - 14 freq anyday (3) - 3 freq animacy (3) - 1 freq 'mair (3) - 7 freq anyhin (3) - 72 freq astair (3) - 1 freq ansar (3) - 1 freq anywan (3) - 22 freq anya (3) - 1 freq |
anymair (0) - 31 freq anymaire (1) - 11 freq onymair (1) - 37 freq anymare (2) - 17 freq naemair (3) - 1 freq oniemair (3) - 4 freq neymar (3) - 1 freq onymare (3) - 2 freq anymore (3) - 14 freq namer (4) - 1 freq anar (4) - 1 freq anomaly (4) - 2 freq nyir (4) - 1 freq onyman (4) - 1 freq ansir (4) - 1 freq admeir (4) - 2 freq animal (4) - 99 freq animate (4) - 1 freq i'mair (4) - 1 freq anemia (4) - 1 freq ansar (4) - 1 freq annmari (4) - 2 freq unfair (4) - 10 freq nair (4) - 2 freq admir (4) - 1 freq |
SoundEx code - A556 anymair - 31 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 - 31 freq anymare - 17 freq anymore - 14 freq anymaire - 11 freq annemar - 1 freq annmari - 2 freq |
ANYMAIR |
| Time to execute Levenshtein function - 0.180738 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.337195 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.027586 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.042933 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.000841 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. |