| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wauchil (0) - 1 freq wauchie (1) - 1 freq rauchil (1) - 2 freq bauchil (1) - 3 freq lauchin (2) - 99 freq raachil (2) - 10 freq waucht (2) - 13 freq watchie (2) - 1 freq trauchil (2) - 2 freq sauchie (2) - 5 freq watchit (2) - 6 freq weechil (2) - 2 freq lauchit (2) - 3 freq watchin (2) - 395 freq fauchie (2) - 3 freq wauchtit (2) - 2 freq gauchin (2) - 1 freq mauchit (2) - 2 freq wauchle (2) - 4 freq wauchelt (2) - 2 freq sauchin (2) - 1 freq bauchilt (2) - 2 freq wauch (2) - 2 freq pauchilt (2) - 1 freq waachin (2) - 1 freq |
wauchil (0) - 1 freq wauchle (2) - 4 freq weechil (2) - 2 freq bauchil (2) - 3 freq wauchie (2) - 1 freq rauchil (2) - 2 freq wauchlin (3) - 1 freq wauchelt (3) - 2 freq wauch (3) - 2 freq waachin (3) - 1 freq wachle (3) - 1 freq weechile (3) - 1 freq waucht (3) - 13 freq raachil (3) - 10 freq wechle (4) - 1 freq bauchlie (4) - 1 freq wachlin (4) - 2 freq rauchle (4) - 8 freq weetchil (4) - 4 freq pochil (4) - 1 freq wacht (4) - 1 freq rachel (4) - 17 freq waache (4) - 1 freq bauchle (4) - 26 freq weechils (4) - 1 freq |
SoundEx code - W240 weekly - 25 freq wisely - 8 freq waikly - 3 freq wycely - 2 freq wiggly - 3 freq whussle - 3 freq weakly - 6 freq weasley - 2 freq weegle - 1 freq wauchle - 4 freq weasel - 3 freq wachle - 1 freq wigly - 1 freq weechil - 2 freq wechle - 1 freq waxweel - 1 freq weechile - 1 freq wicely - 2 freq whussil - 5 freq wheaselie - 1 freq waxwell - 1 freq whizzly - 1 freq wauchil - 1 freq wissel - 1 freq 'wascally - 1 freq wooglie - 1 freq wikkly - 1 freq wickly - 2 freq weigle - 1 freq wxl - 2 freq wcgl - 1 freq weasely - 1 freq wuejl - 1 freq wsshl - 1 freq |
MetaPhone code - WXL weetchil - 4 freq wauchle - 4 freq wachle - 1 freq weechil - 2 freq wechle - 1 freq weechile - 1 freq wauchil - 1 freq witchell - 1 freq |
WAUCHIL |
| Time to execute Levenshtein function - 0.239197 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.598120 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.037942 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.041230 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.000977 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. |