| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| guidwilly (0) - 3 freq guidwill (1) - 3 freq guidwillie (2) - 1 freq guid-will (2) - 1 freq guidwull (2) - 6 freq guidwullie (3) - 1 freq gradwally (3) - 1 freq guidwul (3) - 1 freq goodwill (3) - 3 freq guid-wull (3) - 1 freq guidwife (3) - 41 freq guidwives (3) - 4 freq guid'll (3) - 1 freq guidly (3) - 4 freq gunhill (4) - 2 freq guidlie (4) - 2 freq quirkily (4) - 1 freq guid-sel (4) - 1 freq guiding (4) - 1 freq 'goodwill (4) - 1 freq leidhills (4) - 1 freq audibly (4) - 1 freq guidis (4) - 1 freq tidily (4) - 1 freq fuithills (4) - 2 freq |
guidwilly (0) - 3 freq guidwill (1) - 3 freq guidwull (2) - 6 freq guidwillie (2) - 1 freq goodwill (3) - 3 freq guidwullie (3) - 1 freq guid-will (3) - 1 freq guid-wull (4) - 1 freq guid'll (4) - 1 freq gradwally (4) - 1 freq guidwul (4) - 1 freq 'goodwill (5) - 1 freq godzilla (5) - 1 freq guidwives (5) - 4 freq guidwife (5) - 41 freq guidly (5) - 4 freq leidfully (6) - 1 freq gudely (6) - 1 freq uswally (6) - 1 freq cupwally (6) - 1 freq quadrille (6) - 1 freq ideally (6) - 2 freq 'willy (6) - 1 freq saidill (6) - 1 freq indwell (6) - 1 freq |
SoundEx code - G340 guidly - 4 freq guddle - 34 freq guidlie - 2 freq guidwull - 6 freq guidwullie - 1 freq godly - 6 freq goodwill - 3 freq godlie - 1 freq god'll - 1 freq 'goodwill - 1 freq gudely - 1 freq guidwul - 1 freq gweed-wull - 1 freq guidwilly - 3 freq guid-will - 1 freq gweed'll - 1 freq guid'll - 1 freq guid-wull - 1 freq guidwill - 3 freq guidal - 1 freq godlye - 1 freq goodhall - 1 freq gydal - 1 freq ga'til - 1 freq guid-heal - 1 freq guidwillie - 1 freq goodall - 1 freq godley - 1 freq |
MetaPhone code - KTWL guidwull - 6 freq guidwullie - 1 freq goodwill - 3 freq 'goodwill - 1 freq guidwul - 1 freq guidwilly - 3 freq guid-will - 1 freq guid-wull - 1 freq guidwill - 3 freq guidwillie - 1 freq |
GUIDWILLY |
| Time to execute Levenshtein function - 0.902558 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 - 1.223854 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.088676 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.087014 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.000942 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. |