| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wizard (0) - 18 freq wizard' (1) - 1 freq lizard (1) - 32 freq wizards (1) - 1 freq wizzard (1) - 1 freq wierd (2) - 4 freq i'wizard (2) - 2 freq wird (2) - 576 freq hazard (2) - 2 freq minzard (2) - 1 freq lizards (2) - 3 freq waard (2) - 2 freq ward (2) - 89 freq bizzard (2) - 1 freq bizarn (2) - 1 freq wizzna (3) - 6 freq iar (3) - 2 freq wire (3) - 62 freq woarld (3) - 7 freq wizny (3) - 1 freq naard (3) - 1 freq wid (3) - 3743 freq tiwards (3) - 3 freq wida (3) - 5 freq widid (3) - 2 freq |
wizard (0) - 18 freq wizzard (2) - 1 freq wizards (2) - 1 freq wizard' (2) - 1 freq lizard (2) - 32 freq waard (3) - 2 freq hazard (3) - 2 freq ward (3) - 89 freq i'wizard (3) - 2 freq wierd (3) - 4 freq wird (3) - 576 freq wirdy (4) - 1 freq wurd (4) - 185 freq wayward (4) - 1 freq wazrl (4) - 1 freq werd (4) - 1 freq weerd (4) - 1 freq wared (4) - 9 freq awaard (4) - 1 freq wford (4) - 1 freq word (4) - 697 freq wzrz (4) - 1 freq warid (4) - 5 freq award (4) - 59 freq weyward (4) - 1 freq |
SoundEx code - W263 wiacraitur - 1 freq wizard' - 1 freq wizard - 18 freq wizards - 1 freq wishart - 19 freq weegordiestrach - 1 freq wizzard - 1 freq wzkrduwoyl - 1 freq |
MetaPhone code - WSRT wizard' - 1 freq wizard - 18 freq wizzard - 1 freq |
WIZARD |
| Time to execute Levenshtein function - 0.182385 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.333928 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.027344 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.037467 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.000831 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. |