Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
guidwife (0) - 41 freq guidmife (1) - 2 freq guidwyfe (1) - 24 freq guid-wife (1) - 5 freq gudewife (2) - 1 freq auldwife (2) - 1 freq guidwill (2) - 3 freq deidwife (2) - 1 freq midwife (2) - 5 freq guid-wyfe (2) - 3 freq guidwives (2) - 4 freq guidsire (2) - 1 freq guidwife's (2) - 3 freq gleidwife (2) - 1 freq guidlie (2) - 2 freq guidin' (3) - 1 freq guid-wife's (3) - 1 freq wuidie (3) - 2 freq guidwillie (3) - 1 freq heidwie (3) - 1 freq guiding (3) - 1 freq oulwife (3) - 1 freq guidin (3) - 20 freq guidwull (3) - 6 freq guidis (3) - 1 freq |
guidwife (0) - 41 freq guidwyfe (1) - 24 freq gudewife (2) - 1 freq guid-wife (2) - 5 freq guidmife (2) - 2 freq guid-wyfe (3) - 3 freq gleidwife (3) - 1 freq midwife (3) - 5 freq auldwife (3) - 1 freq deidwife (3) - 1 freq guidwul (4) - 1 freq sadwife (4) - 1 freq gweedwife (4) - 6 freq madwife (4) - 1 freq guidlie (4) - 2 freq guidsire (4) - 1 freq guidwill (4) - 3 freq guidwife's (4) - 3 freq guidwives (4) - 4 freq bauldwife (5) - 1 freq gudgie (5) - 1 freq guide (5) - 91 freq auldrife (5) - 1 freq mid-wife (5) - 5 freq guidwilly (5) - 3 freq |
SoundEx code - G310 guidwife - 41 freq 'guidbye - 1 freq guidbye - 4 freq guidwyfe - 24 freq goodbye - 20 freq gidbye - 1 freq guid-wife - 5 freq 'gidbye' - 1 freq gdp - 3 freq guid-bye - 9 freq gettafu - 1 freq gweedwife - 6 freq gudewife - 1 freq guid-wyfe - 3 freq gdb - 2 freq guid-boy - 2 freq goodby - 1 freq gtf - 2 freq gedboy - 1 freq gdeb - 1 freq 'goodbye' - 1 freq gxdv - 1 freq gydpvb - 1 freq |
MetaPhone code - KTWF guidwife - 41 freq guid-wife - 5 freq gudewife - 1 freq |
GUIDWIFE |
Time to execute Levenshtein function - 0.212708 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.408284 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.031021 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.038417 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.000888 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. |