| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wuzf (0) - 1 freq wulf (1) - 6 freq wuff (1) - 1 freq wuz (1) - 73 freq wiz (2) - 1293 freq wudv (2) - 1 freq tuff (2) - 6 freq wuir (2) - 4 freq wurd (2) - 191 freq wud (2) - 576 freq cuff (2) - 4 freq wrzh (2) - 1 freq cuz (2) - 8 freq uf (2) - 1 freq luif (2) - 34 freq fuff (2) - 6 freq wuvx (2) - 1 freq wsf (2) - 1 freq yuuf (2) - 1 freq wuni (2) - 1 freq waz (2) - 1 freq muzz (2) - 1 freq wtf (2) - 14 freq wurc (2) - 1 freq duff (2) - 24 freq |
wuzf (0) - 1 freq wuff (2) - 1 freq wuz (2) - 73 freq wulf (2) - 6 freq wza (3) - 1 freq szf (3) - 1 freq wgf (3) - 1 freq waf (3) - 1 freq wtf (3) - 14 freq wazn (3) - 2 freq woof (3) - 21 freq dzf (3) - 1 freq wouf (3) - 12 freq wuzna (3) - 1 freq wolf (3) - 91 freq wf (3) - 4 freq waff (3) - 19 freq wauf (3) - 1 freq waif (3) - 1 freq zf (3) - 2 freq wif (3) - 1 freq woz (3) - 1 freq wwf (3) - 1 freq waz (3) - 1 freq weff (3) - 1 freq |
SoundEx code - W210 wisp - 7 freq wak-up - 1 freq wishfu - 1 freq wispy - 5 freq whispy - 1 freq wasp' - 1 freq wishfou - 1 freq wake-up - 1 freq wasp - 5 freq weespy - 1 freq wgbh - 1 freq wash-wife - 1 freq €˜wusp - 1 freq wusp - 1 freq wauk-up - 2 freq wiuqkeb - 1 freq wuzf - 1 freq wqcv - 1 freq wcjxf - 1 freq whassup - 1 freq wsf - 1 freq wjob - 1 freq whackjob - 1 freq wjop - 1 freq wgf - 1 freq wjp - 1 freq wcqoyp - 1 freq wqhab - 1 freq |
MetaPhone code - WSF wuzf - 1 freq |
WUZF |
| Time to execute Levenshtein function - 0.173761 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.308802 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.028278 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.037435 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.000951 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. |