Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
guid-wife (0) - 5 freq guidwife (1) - 41 freq guid-wyfe (1) - 3 freq gudewife (2) - 1 freq guid-wife's (2) - 1 freq mid-wife (2) - 5 freq guidwyfe (2) - 24 freq guidmife (2) - 2 freq guid-will (2) - 1 freq guidsire (3) - 1 freq gleidwife (3) - 1 freq auldwife (3) - 1 freq midwife (3) - 5 freq deidwife (3) - 1 freq guid-bye (3) - 9 freq guidwives (3) - 4 freq guid-wull (3) - 1 freq guidlie (3) - 2 freq mid-life (3) - 1 freq guidwife's (3) - 3 freq 'mid-life (3) - 1 freq guidwill (3) - 3 freq guidit (4) - 17 freq guid-nicht (4) - 2 freq gweedwife (4) - 6 freq |
guid-wife (0) - 5 freq guid-wyfe (1) - 3 freq guidwife (2) - 41 freq guidwyfe (3) - 24 freq mid-wife (3) - 5 freq gudewife (3) - 1 freq guidmife (4) - 2 freq guid-will (4) - 1 freq guid-wife's (4) - 1 freq guid-wull (5) - 1 freq mid-life (5) - 1 freq deidwife (5) - 1 freq guid-bye (5) - 9 freq auldwife (5) - 1 freq gleidwife (5) - 1 freq midwife (5) - 5 freq guid-heal (6) - 1 freq guid-anes (6) - 1 freq guid-een (6) - 1 freq guid-boy (6) - 2 freq sadwife (6) - 1 freq weird-wyfe (6) - 1 freq greenwife (6) - 1 freq madwife (6) - 1 freq guid-sel (6) - 1 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 |
GUID-WIFE |
Time to execute Levenshtein function - 0.196298 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.361146 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.027507 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.037572 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.000938 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. |