| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wheekers (0) - 1 freq wheelers (1) - 1 freq wheeker (1) - 25 freq weekens (2) - 1 freq theeker (2) - 1 freq seekers (2) - 9 freq wheeter (2) - 1 freq heckers (2) - 1 freq keekers (2) - 3 freq cheeters (2) - 1 freq wheeler (2) - 4 freq wheezes (2) - 1 freq wheeeere (2) - 1 freq whuskers (2) - 12 freq wheeked (2) - 8 freq cheesers (2) - 2 freq whiskers (2) - 22 freq wheengers (2) - 1 freq cheepers (2) - 1 freq heefers (2) - 1 freq wheezed (3) - 3 freq ee-ers (3) - 1 freq waukers (3) - 1 freq sheener (3) - 1 freq heers (3) - 2 freq |
wheekers (0) - 1 freq wheeker (2) - 25 freq wheelers (2) - 1 freq whiskers (3) - 22 freq whuskers (3) - 12 freq wikkers (4) - 1 freq winkers (4) - 1 freq wurkers (4) - 6 freq whereas (4) - 8 freq whalers (4) - 8 freq wankers (4) - 5 freq wirkers (4) - 20 freq hikers (4) - 2 freq waarkers (4) - 4 freq shakers (4) - 2 freq hookers (4) - 2 freq warkers (4) - 43 freq wickers (4) - 1 freq waukers (4) - 1 freq wheres (4) - 9 freq wiskers (4) - 1 freq workers (4) - 34 freq keekers (4) - 3 freq cheeters (4) - 1 freq wheeler (4) - 4 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 - WKRS wikkers - 1 freq waukers - 1 freq wheekers - 1 freq wickers - 1 freq |
WHEEKERS |
| Time to execute Levenshtein function - 0.207096 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.387850 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.028185 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.039085 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.000894 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. |