| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gleesum (0) - 1 freq gleeful (2) - 2 freq gruesum (2) - 4 freq flegsum (2) - 1 freq leesur (2) - 1 freq gleesh (2) - 1 freq fleysum (2) - 2 freq glesga (3) - 107 freq glesgy (3) - 7 freq flees (3) - 73 freq treesur (3) - 1 freq gleers (3) - 1 freq glebes (3) - 1 freq gleened (3) - 1 freq pleisur (3) - 33 freq leesh (3) - 2 freq pleesure (3) - 23 freq lanesum (3) - 5 freq gleekin (3) - 4 freq glesca (3) - 168 freq geese (3) - 42 freq glessy (3) - 1 freq glaum (3) - 4 freq pleese (3) - 1 freq glaess (3) - 1 freq |
gleesum (0) - 1 freq fleysum (3) - 2 freq gleesh (3) - 1 freq gruesum (3) - 4 freq dulesum (4) - 1 freq leesome (4) - 9 freq glessie (4) - 3 freq gleam (4) - 7 freq glaesga (4) - 1 freq glaess (4) - 1 freq gledsome (4) - 7 freq glaum (4) - 4 freq gless (4) - 395 freq lousum (4) - 2 freq glesea (4) - 2 freq glegsome (4) - 3 freq glum (4) - 10 freq lusum (4) - 1 freq glessy (4) - 1 freq glesgo (4) - 1 freq gloum (4) - 1 freq leesur (4) - 1 freq flegsum (4) - 1 freq gleeful (4) - 2 freq glesgy (4) - 7 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 - KLSM colluseum - 1 freq colosseum - 2 freq coliseum - 1 freq gleesum - 1 freq klzmu - 1 freq |
GLEESUM |
| Time to execute Levenshtein function - 0.223032 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.345602 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.027736 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.066118 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.000912 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. |