| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| anywhar (0) - 2 freq anywhaur (1) - 2 freq anywhur (1) - 2 freq any-whar (1) - 1 freq onywhar (1) - 4 freq anywherr (2) - 1 freq onywhaar (2) - 1 freq anywhere (2) - 33 freq anywan (2) - 28 freq anyway (2) - 109 freq onywhaur (2) - 58 freq nowhar (2) - 4 freq anywey (3) - 36 freq anyday (3) - 3 freq aawhaur (3) - 5 freq oanyway (3) - 2 freq €˜whar (3) - 3 freq sanchar (3) - 1 freq a'whaur (3) - 1 freq €œwhar (3) - 1 freq anuthur (3) - 1 freq onyway (3) - 22 freq anymair (3) - 33 freq annemar (3) - 1 freq unawaar (3) - 3 freq |
anywhar (0) - 2 freq onywhar (1) - 4 freq anywhur (1) - 2 freq anywhaur (1) - 2 freq nowhar (2) - 4 freq anywhere (2) - 33 freq onywhaur (2) - 58 freq any-whar (2) - 1 freq onywhaar (2) - 1 freq nowhaur (3) - 1 freq onywhere (3) - 27 freq anywherr (3) - 1 freq oniewhar (3) - 2 freq naewhar (3) - 3 freq awhaur (4) - 2 freq awhare (4) - 2 freq naewher (4) - 4 freq anocher (4) - 1 freq 'whar (4) - 1 freq whar (4) - 382 freq naywhere (4) - 1 freq anithir (4) - 17 freq naewhaar (4) - 3 freq naewhaur (4) - 57 freq naewhair (4) - 1 freq |
SoundEx code - A560 ah'mur - 3 freq anywhere - 33 freq ahunner - 1 freq anhere - 1 freq aonner - 1 freq any-whar - 1 freq awner - 4 freq anywhar - 2 freq aumry - 1 freq amor - 1 freq amara - 1 freq aaner - 1 freq amore - 1 freq aumrie - 3 freq ainer - 2 freq anar - 1 freq anywherr - 1 freq anywhaur - 2 freq anurr - 4 freq anurra - 3 freq amour - 1 freq amyire - 1 freq annmari - 2 freq anr - 1 freq anywhur - 2 freq amorra - 2 freq aner - 2 freq |
MetaPhone code - ANHR anywhere - 33 freq anhere - 1 freq any-whar - 1 freq anywhar - 2 freq anywherr - 1 freq anywhaur - 2 freq anywhur - 2 freq |
ANYWHAR |
| Time to execute Levenshtein function - 0.203991 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.349248 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.027688 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.038799 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.000975 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. |