Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
gwickan (0) - 1 freq geckan (2) - 1 freq clickan (2) - 2 freq stickan (2) - 4 freq pickan (2) - 4 freq tickan (2) - 2 freq lickan (2) - 3 freq kickan (2) - 2 freq wirkan (2) - 12 freq swickin (2) - 5 freq speckan (3) - 2 freq tinkan (3) - 1 freq kickoan (3) - 1 freq chuckan (3) - 1 freq wicked (3) - 25 freq nickin (3) - 8 freq knockan (3) - 3 freq twitchan (3) - 2 freq girkin (3) - 1 freq gainan (3) - 1 freq shackan (3) - 1 freq pluckan (3) - 1 freq geian (3) - 1 freq tricklan (3) - 1 freq crackan (3) - 3 freq |
gwickan (0) - 1 freq swickin (3) - 5 freq geckan (3) - 1 freq wickeyn (4) - 1 freq gawkan (4) - 1 freq wackin (4) - 1 freq geckin (4) - 3 freq wirkan (4) - 12 freq stickan (4) - 4 freq tickan (4) - 2 freq clickan (4) - 2 freq lickan (4) - 3 freq kickan (4) - 2 freq pickan (4) - 4 freq flickin (5) - 18 freq cluckan (5) - 1 freq spickin (5) - 58 freq shockan (5) - 1 freq stickin (5) - 107 freq swinkin (5) - 1 freq wicks (5) - 16 freq wakkan (5) - 1 freq gicin (5) - 1 freq quicken (5) - 4 freq chicken (5) - 82 freq |
SoundEx code - G250 guessin - 18 freq gazin - 18 freq geckin - 3 freq gawkin - 13 freq guisin - 30 freq gizzen - 5 freq gacin - 1 freq gushin - 4 freq gaggin - 7 freq gougin - 1 freq giggin - 2 freq gicn - 1 freq gai-jin - 1 freq gwickan - 1 freq gicin - 1 freq gecin - 1 freq gizmo - 2 freq gazan - 2 freq gokkan - 1 freq gawkan - 1 freq gaskin - 1 freq gowkin - 2 freq gowchin - 1 freq gaughan - 8 freq gascon - 2 freq geckan - 1 freq €˜giacomo - 1 freq giacomo - 2 freq guysin - 7 freq gauchin - 1 freq ggigxn - 1 freq guisin' - 1 freq |
MetaPhone code - KWKN gwickan - 1 freq |
GWICKAN |
Time to execute Levenshtein function - 0.300200 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.596454 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.042312 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.049204 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.001175 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. |