| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gowdilocks (0) - 7 freq goldilocks (1) - 1 freq gowanlock (3) - 59 freq gowanlock's (3) - 5 freq €˜goldilocks (3) - 1 freq gowdies (4) - 2 freq deevilocks (4) - 1 freq padlocks (4) - 1 freq goodluck (4) - 2 freq gowdie's (4) - 1 freq heidlocks (4) - 1 freq pollocks (4) - 1 freq warlocks (4) - 5 freq roweloks (4) - 1 freq govenlock (4) - 4 freq gullocks (4) - 1 freq guddicks (4) - 3 freq bollocks (4) - 7 freq roadblock (4) - 3 freq piltocks (5) - 5 freq topicks (5) - 1 freq gadzooks (5) - 1 freq goodlookin (5) - 1 freq headlock (5) - 1 freq goldies (5) - 1 freq |
gowdilocks (0) - 7 freq goldilocks (2) - 1 freq gowanlock's (5) - 5 freq gowanlock (5) - 59 freq warlocks (6) - 5 freq gullocks (6) - 1 freq guddicks (6) - 3 freq heidlocks (6) - 1 freq goodluck (6) - 2 freq €˜goldilocks (6) - 1 freq padlocks (6) - 1 freq gellicks (7) - 5 freq bollocks (7) - 7 freq dialecks (7) - 55 freq wadlock (7) - 1 freq dreadlocks (7) - 1 freq willicks (7) - 2 freq wedlock (7) - 4 freq gowdie's (7) - 1 freq gowdies (7) - 2 freq pollocks (7) - 1 freq roweloks (7) - 1 freq govenlock (7) - 4 freq deevilocks (7) - 1 freq bullocks (8) - 2 freq |
SoundEx code - G342 guid-lookin - 4 freq goodlookin - 1 freq gowdilocks - 7 freq good-looking - 2 freq godless - 12 freq gutless - 1 freq gaidhlig - 8 freq goodluck - 2 freq gweed-lookin - 1 freq guidless - 3 freq guddle's - 1 freq guddles - 2 freq gweed-leukin - 1 freq gà idhlig - 71 freq gödless - 1 freq gà idhlig's - 2 freq goidelic - 3 freq guid-leukin - 1 freq gyte-like - 1 freq gydals - 1 freq godlaek - 1 freq guid-leukkin - 1 freq ghà idhlig - 1 freq gdlujvoe - 1 freq ghdlqo - 1 freq gtalstonwader - 1 freq |
MetaPhone code - KTLKS gowdilocks - 7 freq gà idhlig's - 2 freq |
GOWDILOCKS |
| Time to execute Levenshtein function - 0.391305 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.721710 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.080286 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.037113 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.000919 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. |