| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wanhowpfu (0) - 1 freq wanhowp (2) - 6 freq wanhope (3) - 1 freq howpfu (3) - 20 freq wash-wife (4) - 1 freq wan-off (4) - 1 freq barrowfu (4) - 2 freq wanhap (4) - 1 freq unhelpfu (4) - 1 freq wanrestfu (4) - 5 freq shopfu (4) - 1 freq wanwit (5) - 1 freq howpan (5) - 1 freq waswolf (5) - 3 freq hopefu (5) - 11 freq lawfu (5) - 4 freq bowlfu (5) - 1 freq wonderfu (5) - 4 freq wonnerfu (5) - 3 freq whopper (5) - 3 freq waloper (5) - 1 freq helpfu (5) - 21 freq wunnerfu (5) - 57 freq wallopy (5) - 1 freq win-ower (5) - 1 freq |
wanhowpfu (0) - 1 freq wanhowp (3) - 6 freq howpfu (5) - 20 freq wanhope (5) - 1 freq unhelpfu (6) - 1 freq wanhap (6) - 1 freq whewff (7) - 1 freq howpfie (7) - 1 freq whewph (7) - 1 freq howpfae (7) - 1 freq shopfu (7) - 1 freq wanrestfu (7) - 5 freq wan-off (7) - 1 freq wash-wife (7) - 1 freq wunnderfu (8) - 1 freq waunnerfu (8) - 1 freq wowff (8) - 4 freq weanhood (8) - 2 freq unlawfu (8) - 3 freq howpit (8) - 19 freq whoopin (8) - 5 freq window (8) - 95 freq wanwirt (8) - 2 freq unhelpful (8) - 1 freq wowf (8) - 2 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 - WNHPF wanhowpfu - 1 freq |
WANHOWPFU |
| Time to execute Levenshtein function - 0.210996 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.373177 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.027839 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.038450 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.000933 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. |