Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
wanhope (0) - 1 freq wanhap (2) - 1 freq wanhowp (2) - 6 freq wance (3) - 320 freq hansome (3) - 3 freq wachle (3) - 1 freq walop (3) - 1 freq longhope (3) - 1 freq wanryfe (3) - 1 freq iainpope (3) - 6 freq wannabe (3) - 6 freq wansce (3) - 1 freq walcome (3) - 71 freq wan-off (3) - 1 freq raphoe (3) - 1 freq anhere (3) - 1 freq waloper (3) - 1 freq manhood (3) - 4 freq wanae (3) - 1 freq wancee (3) - 1 freq canopie (3) - 1 freq winsome (3) - 5 freq sandhole (3) - 3 freq nope (3) - 18 freq norhope (3) - 5 freq |
wanhope (0) - 1 freq wanhap (2) - 1 freq wanhowp (3) - 6 freq weanhood (4) - 2 freq wane (5) - 12 freq wallop (5) - 11 freq wanease (5) - 1 freq unhap (5) - 2 freq €˜hope (5) - 2 freq whose (5) - 43 freq wallopy (5) - 1 freq wansie (5) - 1 freq washte (5) - 1 freq canopy (5) - 10 freq whoop (5) - 32 freq shope (5) - 1 freq wanhowpfu (5) - 1 freq ivanhoe (5) - 1 freq wunup (5) - 1 freq whoopee (5) - 3 freq whap (5) - 2 freq windup (5) - 1 freq whip (5) - 14 freq whoopy (5) - 1 freq whup (5) - 8 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 - WNHP wanhowp - 6 freq wanhope - 1 freq wanhap - 1 freq |
WANHOPE |
Time to execute Levenshtein function - 0.241473 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.401604 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.028816 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.044882 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.001103 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. |