| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wieghorst (0) - 1 freq whoost (4) - 1 freq without (4) - 100 freq worst (4) - 103 freq nighbors (4) - 1 freq wierdos (4) - 1 freq wingers (4) - 1 freq withoot (4) - 413 freq dischort (4) - 1 freq ignoret (4) - 4 freq lightest (4) - 2 freq wight (4) - 1 freq ignort (4) - 3 freq wichtest (4) - 1 freq bighorn (4) - 1 freq ghost (4) - 73 freq wiegt (4) - 1 freq highest (4) - 21 freq wishart (4) - 19 freq withers (4) - 5 freq wiecht (4) - 1 freq finghers (4) - 1 freq €˜ghost (4) - 1 freq egoist (4) - 1 freq uighurs (4) - 20 freq |
wieghorst (0) - 1 freq wheerest (6) - 2 freq wishart (6) - 19 freq ghost (6) - 73 freq uighurs (6) - 20 freq highest (6) - 21 freq withert (6) - 4 freq uighers (6) - 1 freq highers (6) - 12 freq wirst (6) - 2 freq wichtest (6) - 1 freq withers (6) - 5 freq whoost (6) - 1 freq worst (6) - 103 freq lightest (6) - 2 freq wight (6) - 1 freq ghawst (7) - 2 freq wurst (7) - 11 freq thirst (7) - 22 freq wagers (7) - 1 freq whores (7) - 2 freq hirst (7) - 2 freq weathert (7) - 1 freq toughest (7) - 4 freq highrise (7) - 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 - WFRST wieghorst - 1 freq |
WIEGHORST |
| Time to execute Levenshtein function - 0.360755 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.798044 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.028889 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.089991 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.000926 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. |