| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wimpy (0) - 5 freq wispy (1) - 5 freq wimps (1) - 1 freq wimp (1) - 1 freq wiley (2) - 1 freq widny (2) - 4 freq jimps (2) - 2 freq wimen (2) - 1 freq wiry (2) - 11 freq wirdy (2) - 1 freq mpy (2) - 1 freq wisp (2) - 7 freq winky (2) - 7 freq windy (2) - 36 freq imp (2) - 3 freq pimps (2) - 1 freq wilny (2) - 2 freq zippy (2) - 3 freq mimly (2) - 2 freq wiy (2) - 56 freq wily (2) - 7 freq wifey (2) - 19 freq whispy (2) - 1 freq impty (2) - 14 freq wimin (2) - 1 freq |
wimpy (0) - 5 freq wimp (1) - 1 freq wimps (2) - 1 freq wispy (2) - 5 freq swampy (3) - 1 freq gimp (3) - 3 freq wip (3) - 3 freq wimin (3) - 1 freq wipe (3) - 54 freq wipp (3) - 1 freq jumpy (3) - 3 freq compy (3) - 1 freq jimp (3) - 34 freq timpo (3) - 1 freq wappy (3) - 1 freq lumpy (3) - 4 freq bumpy (3) - 1 freq wimen (3) - 1 freq mpy (3) - 1 freq empy (3) - 6 freq wim (3) - 2 freq wisp (3) - 7 freq kempy (3) - 2 freq limp (3) - 20 freq imp (3) - 3 freq |
SoundEx code - W510 womb - 8 freq weanp - 1 freq wan-aff - 2 freq wannabe - 6 freq wimp - 1 freq whump - 2 freq wanhowp - 6 freq wanhope - 1 freq wan-off - 1 freq wanhowpfu - 1 freq wanhap - 1 freq winfa - 1 freq wunup - 1 freq wimpy - 5 freq wnvh - 1 freq |
MetaPhone code - WMP wimp - 1 freq whump - 2 freq wimpy - 5 freq |
WIMPY |
| Time to execute Levenshtein function - 0.514704 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.582466 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.037003 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.088800 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.000928 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. |