| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gliskin (0) - 5 freq glinkin (1) - 1 freq gliskit (1) - 7 freq glissin (1) - 2 freq fliskin (1) - 1 freq glessin (2) - 1 freq gleskie (2) - 3 freq friskin (2) - 1 freq pliskie (2) - 11 freq clickin (2) - 13 freq guisin (2) - 30 freq whiskin (2) - 1 freq plinkin (2) - 10 freq gaskin (2) - 1 freq listin (2) - 4 freq gleekin (2) - 4 freq linkin (2) - 15 freq fliskit (2) - 3 freq fliskie (2) - 4 freq glidin (2) - 7 freq glimin (2) - 1 freq glintin (2) - 15 freq lirkin (2) - 1 freq glossin (2) - 4 freq clinkin (2) - 5 freq |
gliskin (0) - 5 freq glinkin (2) - 1 freq fliskin (2) - 1 freq glissin (2) - 2 freq gliskit (2) - 7 freq glisk (3) - 72 freq gaskin (3) - 1 freq gliskens (3) - 1 freq glisked (3) - 10 freq gleekin (3) - 4 freq glisks (3) - 10 freq glossin (3) - 4 freq gleskie (3) - 3 freq glessin (3) - 1 freq blinkin (4) - 33 freq riskin (4) - 5 freq likkin (4) - 1 freq flickin (4) - 18 freq girkin (4) - 1 freq oilskin (4) - 2 freq glesgan (4) - 1 freq glissnin (4) - 1 freq likin (4) - 38 freq blissin (4) - 38 freq flistin (4) - 1 freq |
SoundEx code - G425 gliskin - 5 freq gallusness - 7 freq gloggin - 1 freq gluggin - 2 freq glegsome - 3 freq glaisnock - 1 freq galoshans - 1 freq glossin - 4 freq glissando - 1 freq gliskens - 1 freq gleekin - 4 freq glessin - 1 freq glegness - 7 freq glockenspiels - 1 freq geelgowans - 2 freq gallousin - 1 freq gilzean - 1 freq glissin - 2 freq galician - 2 freq glazin - 2 freq gaelic-inglis - 1 freq gaelic-medium - 10 freq 'galician' - 1 freq gaelicmedium - 1 freq gaelicandscotsconsultation - 1 freq gleesum - 1 freq gollachin - 1 freq glazeen - 1 freq glissnin - 1 freq guylejeune - 3 freq glesgan - 1 freq gaelicinfife - 1 freq geologymull - 1 freq |
MetaPhone code - KLSKN gliskin - 5 freq glesgan - 1 freq |
GLISKIN |
| Time to execute Levenshtein function - 0.194834 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.363815 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.028468 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.037835 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.000923 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. |