| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| guidman (0) - 54 freq guid-man (1) - 2 freq glidan (2) - 1 freq guidar (2) - 1 freq guidson (2) - 4 freq gudeman (2) - 2 freq guideen (2) - 2 freq guidal (2) - 1 freq gundyman (2) - 3 freq guidin (2) - 20 freq guidon (2) - 1 freq heidman (2) - 1 freq guidman's (2) - 7 freq suiden (3) - 1 freq guiders (3) - 1 freq weiman (3) - 1 freq i'man (3) - 1 freq tuimin (3) - 2 freq cuida (3) - 2 freq guid-anes (3) - 1 freq wuidlans (3) - 1 freq wutnman (3) - 1 freq guid (3) - 3650 freq guid' (3) - 1 freq judean (3) - 1 freq |
guidman (0) - 54 freq gudeman (2) - 2 freq guid-man (2) - 2 freq guidin (3) - 20 freq heidman (3) - 1 freq gundyman (3) - 3 freq guidon (3) - 1 freq guideen (3) - 2 freq guidson (3) - 4 freq german (4) - 156 freq gideon (4) - 2 freq gleaman (4) - 1 freq roadman (4) - 3 freq gummin (4) - 1 freq guid-een (4) - 1 freq gweedman (4) - 3 freq heidmen (4) - 1 freq hodman (4) - 1 freq madman (4) - 7 freq guidmife (4) - 2 freq gazman (4) - 1 freq gloaman (4) - 2 freq gimin (4) - 2 freq grimin (4) - 1 freq guidman's (4) - 7 freq |
SoundEx code - G355 guidman - 54 freq guidman's - 7 freq gudeman - 2 freq gweedman - 3 freq guid-man - 2 freq gødman's - 1 freq getmaimmodium - 1 freq |
MetaPhone code - KTMN guidman - 54 freq gudeman - 2 freq cotman - 1 freq guid-man - 2 freq |
GUIDMAN |
| Time to execute Levenshtein function - 0.402857 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.889998 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.080902 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.083882 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.000973 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. |