| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gdwood (0) - 11 freq good (2) - 1025 freq dood (2) - 1 freq wood (2) - 67 freq goood (2) - 3 freq drook (3) - 1 freq gond (3) - 1 freq gloom (3) - 32 freq wooda (3) - 10 freq 'cood (3) - 1 freq kenwood (3) - 1 freq 'good (3) - 7 freq wildwood (3) - 1 freq goo (3) - 5 freq gdog (3) - 1 freq go-d (3) - 1 freq woot (3) - 1 freq wold (3) - 1 freq groof (3) - 1 freq strood (3) - 1 freq goom (3) - 1 freq galoot (3) - 8 freq clood (3) - 80 freq woud (3) - 5 freq 'word (3) - 1 freq |
gdwood (0) - 11 freq good (4) - 1025 freq gdd (4) - 2 freq gweed (4) - 482 freq gdnd (4) - 1 freq gowd (4) - 224 freq gdewjo (4) - 1 freq gawd (4) - 2 freq wood (4) - 67 freq dood (4) - 1 freq growd (4) - 1 freq goood (4) - 3 freq gwd (4) - 1 freq groond (5) - 74 freq bindwood (5) - 2 freq girnwood (5) - 4 freq gowped (5) - 5 freq edward (5) - 33 freq godheid (5) - 5 freq woad (5) - 1 freq dawed (5) - 3 freq good' (5) - 2 freq goodo (5) - 1 freq gawked (5) - 6 freq droid (5) - 1 freq |
SoundEx code - G330 gutted - 32 freq guidit - 17 freq gteat - 1 freq guttit - 4 freq goadit - 3 freq guttet - 8 freq guided - 16 freq gated - 1 freq godheid - 5 freq gydit - 3 freq goaded - 1 freq godot - 1 freq €™guided - 1 freq gtid - 1 freq gdwood - 11 freq |
MetaPhone code - KTWT gdwood - 11 freq |
GDWOOD |
| Time to execute Levenshtein function - 0.736690 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.794336 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.087035 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.096654 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.000898 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. |