| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| anywhaur (0) - 2 freq anywhar (1) - 2 freq anywhur (1) - 2 freq onywhaur (1) - 58 freq onywhar (2) - 4 freq anywherr (2) - 1 freq any-whar (2) - 1 freq a'whaur (2) - 1 freq aawhaur (2) - 4 freq onywhaar (2) - 1 freq innywhaur (2) - 1 freq awhaur (2) - 2 freq nowhaur (2) - 1 freq nowhar (3) - 4 freq anyway (3) - 106 freq evrywhaur (3) - 1 freq aawhaurs (3) - 1 freq awhaurs (3) - 1 freq anywaiy (3) - 17 freq anywhere (3) - 30 freq €˜whaur (3) - 2 freq nae-whaur (3) - 1 freq 'whaur (3) - 24 freq oniewhaur (3) - 16 freq awwhaurs (3) - 1 freq |
anywhaur (0) - 2 freq anywhur (1) - 2 freq onywhaur (1) - 58 freq anywhar (1) - 2 freq onywhaar (2) - 1 freq nowhaur (2) - 1 freq onywhar (2) - 4 freq nowhar (3) - 4 freq naewhaur (3) - 57 freq awhaur (3) - 2 freq oniewhaur (3) - 16 freq anywhere (3) - 30 freq a'whaur (3) - 1 freq innywhaur (3) - 1 freq anywherr (3) - 1 freq aawhaur (3) - 4 freq any-whar (3) - 1 freq naewhur (4) - 4 freq ontewhaur (4) - 1 freq whaur (4) - 1961 freq onywhere (4) - 27 freq oniewhur (4) - 1 freq anuthur (4) - 1 freq naewhar (4) - 3 freq 'whaur (4) - 24 freq |
SoundEx code - A560 ah'mur - 3 freq anywhere - 30 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 - 30 freq anhere - 1 freq any-whar - 1 freq anywhar - 2 freq anywherr - 1 freq anywhaur - 2 freq anywhur - 2 freq |
ANYWHAUR |
| Time to execute Levenshtein function - 0.175771 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.337224 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.027784 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.036911 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.000824 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. |