| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gowdspink (0) - 4 freq gowpins (3) - 1 freq gowpin (3) - 30 freq gowden (4) - 233 freq owerhink (4) - 5 freq glowstick (4) - 1 freq gowpen (4) - 4 freq jowpin (4) - 1 freq gowpent (4) - 1 freq gordin (4) - 2 freq cowping (4) - 1 freq gordson (4) - 1 freq goupin (4) - 1 freq goldson (4) - 1 freq gowdfish (4) - 9 freq gawpin (4) - 33 freq gowdens (4) - 1 freq gowdie (4) - 8 freq bowsin (4) - 1 freq lowping (4) - 1 freq gowlhin (4) - 1 freq goodsir (4) - 6 freq howpin (4) - 45 freq gowds (4) - 1 freq grespin (4) - 3 freq |
gowdspink (0) - 4 freq gowpins (6) - 1 freq gowpin (6) - 30 freq godsend (7) - 3 freq graspin (7) - 7 freq gowpens (7) - 1 freq godssend (7) - 3 freq gowdwark (7) - 1 freq grespin (7) - 3 freq graspin' (7) - 2 freq heidspin (7) - 2 freq gasping (7) - 2 freq gossiping (7) - 2 freq gaspin (7) - 13 freq gowdies (7) - 2 freq gossipin (7) - 3 freq grasping (7) - 2 freq graispin (7) - 2 freq gowds (7) - 1 freq gaspin' (7) - 1 freq spink (7) - 1 freq gawpin (7) - 33 freq gordson (7) - 1 freq gowdens (7) - 1 freq gowpen (7) - 4 freq |
SoundEx code - G321 gut-sprung - 1 freq gatsby - 1 freq gatekeepers - 11 freq gatekeepin - 1 freq gettkeeper - 1 freq gowdspink - 4 freq guideship - 1 freq gtjpn - 1 freq gydxbtw - 1 freq gdsfc - 1 freq gatekeeper - 1 freq |
MetaPhone code - KTSPNK gowdspink - 4 freq |
GOWDSPINK |
| Time to execute Levenshtein function - 0.203386 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.352907 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.027457 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.037342 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.000795 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. |