| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wisker (0) - 1 freq wirker (1) - 5 freq wicker (1) - 2 freq wiker (1) - 1 freq wikker (1) - 1 freq whisker (1) - 1 freq wiskers (1) - 1 freq wiser (1) - 26 freq wikken (2) - 1 freq sinker (2) - 1 freq bosker (2) - 6 freq winder (2) - 112 freq bicker (2) - 12 freq waster (2) - 13 freq wissed (2) - 13 freq warker (2) - 7 freq wiener (2) - 2 freq wirked (2) - 35 freq fisher (2) - 41 freq waiker (2) - 5 freq wskea (2) - 1 freq wiler (2) - 1 freq wise (2) - 80 freq walker (2) - 25 freq mirker (2) - 1 freq |
wisker (0) - 1 freq whisker (2) - 1 freq wiskers (2) - 1 freq wikker (2) - 1 freq wiser (2) - 26 freq wiker (2) - 1 freq wirker (2) - 5 freq wicker (2) - 2 freq weaker (3) - 4 freq elsker (3) - 1 freq waister (3) - 1 freq worker (3) - 23 freq waaker (3) - 1 freq wanker (3) - 14 freq werker (3) - 2 freq basker (3) - 1 freq tusker (3) - 2 freq fusker (3) - 1 freq wurker (3) - 3 freq busker (3) - 2 freq wasser (3) - 1 freq sker (3) - 1 freq waeker (3) - 1 freq whiskery (3) - 1 freq washer (3) - 5 freq |
SoundEx code - W260 wycer - 6 freq wiser - 26 freq waiker - 5 freq wisker - 1 freq washer - 5 freq washer' - 1 freq wheecher - 2 freq wager - 9 freq weaker - 4 freq wicker - 2 freq whacker - 1 freq waaker - 1 freq whiskery - 1 freq wajer - 1 freq wokir - 1 freq wiker - 1 freq wauger - 3 freq wikker - 1 freq waeker - 1 freq whisker - 1 freq wheeker - 25 freq wasser - 1 freq wyacry - 1 freq wkr - 1 freq wwjr - 1 freq |
MetaPhone code - WSKR wisker - 1 freq whiskery - 1 freq whisker - 1 freq |
WISKER |
| Time to execute Levenshtein function - 0.207575 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.394942 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.028133 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.039535 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.004553 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. |