Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
guidwyfe (0) - 24 freq guid-wyfe (1) - 3 freq guidwife (1) - 41 freq guidbye (2) - 4 freq guidmife (2) - 2 freq guid-wife (2) - 5 freq guidwull (3) - 6 freq guidwife's (3) - 3 freq guidwill (3) - 3 freq guidbyes (3) - 2 freq guid-bye (3) - 9 freq guidly (3) - 4 freq gudewife (3) - 1 freq guidance (3) - 42 freq guide (3) - 91 freq gleidwife (3) - 1 freq auldwife (3) - 1 freq guidsire (3) - 1 freq deidwife (3) - 1 freq midwife (3) - 5 freq guidlie (3) - 2 freq guidwul (3) - 1 freq 'guidbye (3) - 1 freq guidwives (3) - 4 freq gidbye (3) - 1 freq |
guidwyfe (0) - 24 freq guidwife (1) - 41 freq guid-wyfe (2) - 3 freq guid-wife (3) - 5 freq guidmife (3) - 2 freq gudewife (3) - 1 freq midwife (4) - 5 freq guidwul (4) - 1 freq gleidwife (4) - 1 freq auldwife (4) - 1 freq deidwife (4) - 1 freq guidbye (4) - 4 freq guidlie (5) - 2 freq gidbye (5) - 1 freq gweedwife (5) - 6 freq guidwives (5) - 4 freq sadwife (5) - 1 freq madwife (5) - 1 freq guidwill (5) - 3 freq guidwull (5) - 6 freq guidsire (5) - 1 freq guidbyes (5) - 2 freq guidwife's (5) - 3 freq guid-bye (5) - 9 freq guidance (5) - 42 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 - KTF guidwyfe - 24 freq cud'v - 1 freq cuddief - 1 freq cud've - 3 freq guid-wyfe - 3 freq qdf - 1 freq kkwdf - 1 freq kdf - 1 freq gtf - 2 freq ctf - 1 freq qdvw - 1 freq cdv - 1 freq |
GUIDWYFE |
Time to execute Levenshtein function - 0.191094 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.369120 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.027683 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.038998 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.000863 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. |