| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| anywhur (0) - 2 freq anywhar (1) - 2 freq anywhaur (1) - 2 freq anywherr (2) - 1 freq any-whar (2) - 1 freq anuthur (2) - 1 freq onywhar (2) - 4 freq anywhere (2) - 33 freq onywhaur (2) - 58 freq onywuy (3) - 1 freq anyway (3) - 109 freq nowhar (3) - 4 freq answer (3) - 444 freq anithir (3) - 17 freq anyun (3) - 1 freq awhaur (3) - 2 freq anither (3) - 2011 freq anywye (3) - 1 freq naewhur (3) - 4 freq anyweys (3) - 1 freq an'wul (3) - 1 freq anyhin (3) - 69 freq anithr (3) - 2 freq anchor (3) - 28 freq anther (3) - 2 freq |
anywhur (0) - 2 freq anywhaur (1) - 2 freq anywhar (1) - 2 freq anywhere (2) - 33 freq onywhaur (2) - 58 freq onywhar (2) - 4 freq naewhur (3) - 4 freq onywhaar (3) - 1 freq onywhere (3) - 27 freq nowhaur (3) - 1 freq nowhar (3) - 4 freq oniewhur (3) - 1 freq anuthur (3) - 1 freq any-whar (3) - 1 freq anywherr (3) - 1 freq anocher (4) - 1 freq naewhar (4) - 3 freq oniewhaur (4) - 16 freq aawhaur (4) - 5 freq naewher (4) - 4 freq another (4) - 449 freq oniewhar (4) - 2 freq naewhaur (4) - 57 freq a'whaur (4) - 1 freq whur (4) - 63 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 |
ANYWHUR |
| Time to execute Levenshtein function - 0.295544 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.584427 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.027872 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.071272 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.000892 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. |