Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
wizzard (0) - 1 freq bizzard (1) - 1 freq wizard (1) - 19 freq bizzare (2) - 1 freq minzard (2) - 1 freq wizards (2) - 1 freq buzzard (2) - 3 freq blizzard (2) - 4 freq wizard' (2) - 1 freq lizard (2) - 32 freq 'willard (3) - 1 freq bizarn (3) - 1 freq vizzied (3) - 26 freq aipward (3) - 1 freq wizened (3) - 2 freq discard (3) - 1 freq midgard (3) - 1 freq dizzied (3) - 1 freq mizzled (3) - 1 freq widnad (3) - 1 freq fizzer (3) - 6 freq wird (3) - 583 freq widland (3) - 10 freq fizzers (3) - 1 freq i'wizard (3) - 2 freq |
wizzard (0) - 1 freq bizzard (2) - 1 freq wizard (2) - 19 freq buzzard (3) - 3 freq lizard (4) - 32 freq mizzered (4) - 2 freq wizard' (4) - 1 freq wizzened (4) - 2 freq blizzard (4) - 4 freq bizzare (4) - 1 freq minzard (4) - 1 freq wizards (4) - 1 freq fizzled (5) - 3 freq whizzed (5) - 4 freq wierd (5) - 4 freq rizzert (5) - 1 freq wozza (5) - 2 freq winnerd (5) - 1 freq ward (5) - 89 freq fizzed (5) - 1 freq hazard (5) - 2 freq wayward (5) - 1 freq gizzern (5) - 1 freq winderd (5) - 1 freq wizzen (5) - 4 freq |
SoundEx code - W263 wiacraitur - 1 freq wizard' - 1 freq wizard - 19 freq wizards - 1 freq wishart - 19 freq weegordiestrach - 1 freq wizzard - 1 freq wzkrduwoyl - 1 freq |
MetaPhone code - WSRT wizard' - 1 freq wizard - 19 freq wizzard - 1 freq |
WIZZARD |
Time to execute Levenshtein function - 0.276975 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.501740 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.027559 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.063650 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.000879 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. |