| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wan-aff (0) - 1 freq wan-off (1) - 1 freq far-aff (2) - 6 freq ane-aff (2) - 4 freq yin-aff (2) - 1 freq rin-aff (2) - 1 freq tap-aff (2) - 1 freq hyne-aff (3) - 1 freq send-aff (3) - 1 freq wanryfe (3) - 1 freq nyaff (3) - 24 freq anoff (3) - 6 freq wannabe (3) - 6 freq haad-aff (3) - 1 freq wanlas (3) - 1 freq banff (3) - 45 freq wannae (3) - 6 freq wanda (3) - 1 freq faur-aff (3) - 10 freq sign-aff (3) - 1 freq tapsaff (3) - 4 freq wan- (3) - 2 freq wan-nil (3) - 1 freq waff (3) - 19 freq ill-aff (3) - 6 freq |
wan-aff (0) - 1 freq wan-off (1) - 1 freq yin-aff (3) - 1 freq rin-aff (3) - 1 freq ane-aff (3) - 4 freq one-aff (4) - 1 freq weel-aff (4) - 28 freq hyne-aff (4) - 1 freq tap-aff (4) - 1 freq far-aff (4) - 6 freq wan-wye (5) - 1 freq annuff (5) - 1 freq wan-but (5) - 1 freq ill-aff (5) - 6 freq naff (5) - 2 freq rip-aff (5) - 3 freq weelaff (5) - 1 freq waff (5) - 19 freq staun-aff (5) - 2 freq anuff (5) - 28 freq sair-aff (5) - 3 freq wan-man (5) - 1 freq wan-nil (5) - 1 freq haad-aff (5) - 1 freq nyaff (5) - 24 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 - WNF wan-off - 1 freq winfa - 1 freq wan-aff - 1 freq |
WAN-AFF |
| Time to execute Levenshtein function - 0.198966 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.371061 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.028344 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.037501 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.000847 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. |