| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yin-aff (0) - 1 freq rin-aff (1) - 1 freq sign-aff (2) - 1 freq rip-aff (2) - 3 freq wan-aff (2) - 2 freq yin-act (2) - 2 freq yit-an (3) - 2 freq naff (3) - 2 freq yin-but (3) - 2 freq far-aff (3) - 6 freq xingafi (3) - 1 freq one-aff (3) - 1 freq tin-an (3) - 1 freq rif-raff (3) - 1 freq yin-man (3) - 2 freq kinneff (3) - 1 freq yinday (3) - 1 freq inuff (3) - 1 freq nyaff (3) - 24 freq hyne-aff (3) - 1 freq kick-aff (3) - 4 freq tap-aff (3) - 1 freq ane-aff (3) - 4 freq yin-yang (3) - 1 freq wan-off (3) - 1 freq |
yin-aff (0) - 1 freq rin-aff (2) - 1 freq wan-aff (3) - 2 freq ane-aff (3) - 4 freq one-aff (3) - 1 freq hyne-aff (4) - 1 freq nyaff (4) - 24 freq inuff (4) - 1 freq rip-aff (4) - 3 freq wan-off (4) - 1 freq sign-aff (4) - 1 freq naff (4) - 2 freq yin-act (4) - 2 freq sair-aff (5) - 3 freq ill-aff (5) - 6 freq enuff (5) - 12 freq enoff (5) - 1 freq anoff (5) - 6 freq anuff (5) - 28 freq naffu (5) - 1 freq niff (5) - 1 freq yin-yang (5) - 1 freq send-aff (5) - 1 freq incalf (5) - 1 freq kinneff (5) - 1 freq |
SoundEx code - Y510 ymp - 2 freq yin-aff - 1 freq ynbiw - 1 freq yonf - 1 freq |
MetaPhone code - YNF yin-aff - 1 freq yonf - 1 freq |
YIN-AFF |
| Time to execute Levenshtein function - 0.245765 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.421802 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.034209 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.040063 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.000929 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. |