| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wimpy (0) - 5 freq wimp (1) - 1 freq wimps (1) - 1 freq wispy (1) - 5 freq wirdy (2) - 1 freq widy (2) - 6 freq timmy (2) - 2 freq swampy (2) - 1 freq wisny (2) - 4 freq jumpy (2) - 2 freq wiley (2) - 1 freq limp (2) - 19 freq wipp (2) - 1 freq compy (2) - 1 freq limply (2) - 1 freq windy (2) - 35 freq mimly (2) - 2 freq gimp (2) - 3 freq imply (2) - 2 freq winky (2) - 7 freq wilny (2) - 2 freq willy (2) - 12 freq simmy (2) - 1 freq wipe (2) - 53 freq jimpt (2) - 1 freq |
wimpy (0) - 5 freq wimp (1) - 1 freq wispy (2) - 5 freq wimps (2) - 1 freq wisp (3) - 6 freq kempy (3) - 2 freq weepy (3) - 3 freq wappy (3) - 1 freq mpy (3) - 1 freq wipe (3) - 53 freq timpo (3) - 1 freq imp (3) - 3 freq wimen (3) - 1 freq gimp (3) - 3 freq bumpy (3) - 1 freq wimin (3) - 1 freq jimp (3) - 34 freq wipp (3) - 1 freq swampy (3) - 1 freq wim (3) - 2 freq limp (3) - 19 freq empy (3) - 6 freq compy (3) - 1 freq lumpy (3) - 4 freq wip (3) - 3 freq |
SoundEx code - W510 womb - 8 freq weanp - 1 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 wan-aff - 1 freq |
MetaPhone code - WMP wimp - 1 freq whump - 2 freq wimpy - 5 freq |
WIMPY |
| Time to execute Levenshtein function - 0.213085 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.357019 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.027772 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.038057 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.000806 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. |