| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| goodnaturtly (0) - 1 freq goodnatured (3) - 1 freq good-naturedly (3) - 2 freq good-naturt (3) - 2 freq goodyactually (4) - 3 freq guid-naturedly (5) - 1 freq gud-naturt (5) - 2 freq cooardly (6) - 1 freq naturally (6) - 44 freq contantly (6) - 1 freq goodlyburnps (6) - 1 freq goodnight (6) - 7 freq momentarily (6) - 7 freq guid-natured (6) - 2 freq unnaturally (6) - 1 freq shoartly (6) - 2 freq natural (6) - 1 freq goodall (6) - 1 freq prematurely (6) - 1 freq natural (6) - 90 freq unnatural (6) - 5 freq goodlyburn (6) - 1 freq poignantly (6) - 1 freq goldsworthy (6) - 2 freq bonaparty (6) - 1 freq |
goodnaturtly (0) - 1 freq good-naturt (5) - 2 freq good-naturedly (5) - 2 freq goodnatured (5) - 1 freq guid-naturedly (7) - 1 freq gud-naturt (7) - 2 freq goodyactually (7) - 3 freq donnertly (8) - 1 freq guid-naturet (8) - 1 freq natural (9) - 90 freq unnatural (9) - 5 freq ordinarily (9) - 2 freq coontert (9) - 1 freq natural (9) - 1 freq guid-natured (9) - 2 freq contantly (9) - 1 freq naturally (9) - 44 freq goodnight (9) - 7 freq momentarily (9) - 7 freq unnaturally (9) - 1 freq gantry (10) - 6 freq naturet (10) - 1 freq contortin (10) - 1 freq dastartlie (10) - 1 freq doonwart (10) - 3 freq |
SoundEx code - G353 good-naturt - 2 freq goodnaturtly - 1 freq guid-naitured - 2 freq guidmither - 3 freq guid-naturet - 1 freq gotten't - 1 freq god-damned - 1 freq guid-mither - 6 freq guid-mithers - 1 freq guid-naturedly - 1 freq guid-natured - 2 freq gweed-mither - 1 freq godmither - 3 freq good-naturedly - 2 freq gate-end - 1 freq goodnatured - 1 freq god-damnt - 1 freq gud-naturt - 2 freq getmethinagain - 1 freq gdnd - 1 freq gcdnd - 1 freq |
MetaPhone code - KTNTRTL goodnaturtly - 1 freq guid-naturedly - 1 freq good-naturedly - 2 freq |
GOODNATURTLY |
| Time to execute Levenshtein function - 0.210763 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.440060 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.027675 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.037242 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.000980 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. |