| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gaskin (0) - 1 freq askin (1) - 183 freq gawkin (1) - 13 freq baskin (1) - 10 freq gaskit (1) - 1 freq maskin (1) - 8 freq gaspin (1) - 13 freq taikin (2) - 1 freq ganshin (2) - 3 freq hashin (2) - 2 freq gaarin (2) - 1 freq gushin (2) - 4 freq cackin (2) - 1 freq harkin (2) - 5 freq awkin (2) - 2 freq rankin (2) - 16 freq nashin (2) - 3 freq gask (2) - 2 freq askan (2) - 10 freq mackin (2) - 1 freq gerkin (2) - 1 freq fastin (2) - 14 freq gowkin (2) - 2 freq askin' (2) - 5 freq maskin' (2) - 1 freq |
gaskin (0) - 1 freq maskin (2) - 8 freq askin (2) - 183 freq gaskit (2) - 1 freq gaspin (2) - 13 freq baskin (2) - 10 freq gawkin (2) - 13 freq geckin (3) - 3 freq gerkin (3) - 1 freq girkin (3) - 1 freq gowkin (3) - 2 freq askan (3) - 10 freq gask (3) - 2 freq gustin (3) - 1 freq asken (3) - 4 freq buskin (3) - 11 freq gliskin (3) - 5 freq gawkan (3) - 1 freq gascon (3) - 2 freq baskan (3) - 1 freq skin (3) - 270 freq gasket (3) - 2 freq eskin (3) - 2 freq gushin (3) - 4 freq riskin (3) - 5 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 - KSKN gaskin - 1 freq gascon - 2 freq ggzkun - 1 freq |
GASKIN |
| Time to execute Levenshtein function - 0.240943 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.422665 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.028224 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.039271 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.000943 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. |