| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gudewife (0) - 1 freq guidwife (2) - 41 freq guid-wife (2) - 5 freq auldwife (3) - 1 freq alewife (3) - 1 freq lanewife (3) - 1 freq sadwife (3) - 1 freq guidmife (3) - 2 freq madwife (3) - 1 freq oulwife (3) - 1 freq guidwyfe (3) - 24 freq gudgie (3) - 1 freq guid-wyfe (3) - 3 freq greenwife (3) - 1 freq mid-wife (3) - 5 freq gweedwife (3) - 6 freq yolewife (3) - 1 freq housewife (3) - 2 freq dewie (3) - 1 freq spaewife (3) - 6 freq midwife (3) - 5 freq guddle (4) - 34 freq dewtie (4) - 8 freq guise (4) - 17 freq wuddie (4) - 1 freq |
gudewife (0) - 1 freq guidwife (2) - 41 freq guidwyfe (3) - 24 freq guid-wife (3) - 5 freq guid-wyfe (4) - 3 freq madwife (4) - 1 freq gweedwife (4) - 6 freq midwife (4) - 5 freq auldwife (4) - 1 freq sadwife (4) - 1 freq guidmife (4) - 2 freq dewie (5) - 1 freq spaewife (5) - 6 freq gdewjo (5) - 1 freq deidwife (5) - 1 freq gleidwife (5) - 1 freq housewife (5) - 2 freq gudgie (5) - 1 freq oulwife (5) - 1 freq yolewife (5) - 1 freq lanewife (5) - 1 freq mid-wife (5) - 5 freq greenwife (5) - 1 freq alewife (5) - 1 freq ludwig (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 |
GUDEWIFE |
| Time to execute Levenshtein function - 0.196868 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.344662 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.027206 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.038467 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.000856 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. |