| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| anywhere (0) - 33 freq anywherr (1) - 1 freq onywhere (1) - 27 freq 'onywhere (2) - 1 freq oniwhere (2) - 1 freq onywheres (2) - 1 freq erywhere (2) - 1 freq nowhere (2) - 9 freq anywhur (2) - 2 freq anywhar (2) - 2 freq anhere (2) - 1 freq naywhere (2) - 1 freq a'where (2) - 1 freq oniewhere (3) - 1 freq anyweys (3) - 1 freq answers (3) - 74 freq answered (3) - 116 freq anymaire (3) - 11 freq awhare (3) - 2 freq 'where (3) - 15 freq “where (3) - 1 freq answer- (3) - 1 freq anther (3) - 2 freq anither' (3) - 1 freq €™where (3) - 2 freq |
anywhere (0) - 33 freq onywhere (1) - 27 freq nowhere (2) - 9 freq anywhur (2) - 2 freq naywhere (2) - 1 freq oniwhere (2) - 1 freq anywherr (2) - 1 freq anywhar (2) - 2 freq oniewhere (3) - 1 freq naewhere (3) - 49 freq a'where (3) - 1 freq anywhaur (3) - 2 freq onywhar (3) - 4 freq anhere (3) - 1 freq onywheres (3) - 1 freq 'onywhere (3) - 1 freq erywhere (3) - 1 freq 'naewhere (4) - 1 freq any-whar (4) - 1 freq anocher (4) - 1 freq anither (4) - 2011 freq onywhaar (4) - 1 freq nowhar (4) - 4 freq naewher (4) - 4 freq another (4) - 449 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 |
ANYWHERE |
| Time to execute Levenshtein function - 0.185017 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.342989 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.028248 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.040315 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.000930 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. |