| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| whuskers (0) - 12 freq whiskers (1) - 22 freq whuspers (1) - 5 freq hunkers (2) - 11 freq whispers (2) - 44 freq whisker (2) - 1 freq wiskers (2) - 1 freq wheekers (2) - 1 freq whiskeys (2) - 4 freq whusks (2) - 1 freq whuspert (2) - 57 freq whuskies (2) - 1 freq waukers (2) - 1 freq whusper (2) - 20 freq fuskers (2) - 21 freq wurkers (2) - 6 freq chuckers (2) - 1 freq whiskery (2) - 1 freq whuskey (2) - 7 freq buskers (2) - 2 freq whispern (3) - 1 freq wheeker (3) - 25 freq chokkers (3) - 1 freq burkers (3) - 2 freq younkers (3) - 9 freq |
whuskers (0) - 12 freq whiskers (1) - 22 freq whuspers (2) - 5 freq whusks (3) - 1 freq whuskies (3) - 1 freq whiskeys (3) - 4 freq whiskery (3) - 1 freq wheekers (3) - 1 freq whispers (3) - 44 freq whisker (3) - 1 freq wiskers (3) - 1 freq whuskey (4) - 7 freq whiskies (4) - 3 freq chuckers (4) - 1 freq whiskas (4) - 1 freq buskers (4) - 2 freq whuspert (4) - 57 freq wurkers (4) - 6 freq waukers (4) - 1 freq hunkers (4) - 11 freq fuskers (4) - 21 freq whusper (4) - 20 freq whusky (5) - 3 freq whussles (5) - 2 freq shakers (5) - 2 freq |
SoundEx code - W262 whiskers - 22 freq whuskers - 12 freq washer's - 1 freq washers - 1 freq wagers - 1 freq waxwarks - 2 freq wikkers - 1 freq wieghorst - 1 freq waukers - 1 freq wiskers - 1 freq wuqrqlodfj - 1 freq wheekers - 1 freq wgjgrecg - 1 freq wowzers - 1 freq wickers - 1 freq weekirstyw - 1 freq wzroqhl - 1 freq wzrz - 1 freq wyqrwcrfw - 1 freq |
MetaPhone code - WSKRS whiskers - 22 freq whuskers - 12 freq wiskers - 1 freq |
WHUSKERS |
| Time to execute Levenshtein function - 0.194194 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.364624 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.027384 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.037303 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.000840 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. |