| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| anymair (0) - 33 freq onymair (1) - 38 freq anymaire (1) - 11 freq anymare (2) - 17 freq anywaiy (2) - 17 freq ansar (3) - 1 freq anglais (3) - 2 freq enshair (3) - 1 freq annemar (3) - 1 freq anywhaur (3) - 2 freq royhair (3) - 3 freq ansir (3) - 1 freq anundir (3) - 1 freq anemia (3) - 1 freq annidir (3) - 1 freq nair (3) - 2 freq xnair (3) - 1 freq onyman (3) - 1 freq €˜mair (3) - 6 freq animate (3) - 1 freq onymare (3) - 2 freq admeir (3) - 2 freq anywiy (3) - 8 freq unshair (3) - 3 freq acair (3) - 1 freq |
anymair (0) - 33 freq anymaire (1) - 11 freq onymair (1) - 38 freq anymare (2) - 17 freq oniemair (3) - 4 freq neymar (3) - 1 freq naemair (3) - 1 freq anymore (3) - 14 freq onymare (3) - 2 freq i'mair (4) - 1 freq animacy (4) - 1 freq alomar (4) - 1 freq ymir (4) - 3 freq 'mair (4) - 8 freq unfair (4) - 10 freq animal (4) - 101 freq anomaly (4) - 2 freq mair (4) - 6172 freq admir (4) - 1 freq annmari (4) - 2 freq nyir (4) - 1 freq anar (4) - 1 freq anemia (4) - 1 freq namer (4) - 1 freq ansir (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 |
ANYMAIR |
| Time to execute Levenshtein function - 0.216304 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.374551 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.027689 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.041119 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.000901 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. |