Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
glessfy (0) - 1 freq glessfu (1) - 2 freq glessy (1) - 1 freq glessfi (1) - 1 freq glossy (2) - 14 freq glossay (2) - 1 freq glesgay (2) - 1 freq glassfu (2) - 1 freq glesgy (2) - 7 freq gless (2) - 395 freq glesses (2) - 96 freq gressy (2) - 15 freq glessin (2) - 1 freq glassy (2) - 2 freq glessis (2) - 5 freq glessie (2) - 3 freq glosst (3) - 1 freq glesgae (3) - 17 freq plessed (3) - 1 freq glens (3) - 44 freq leafy (3) - 6 freq gledly (3) - 5 freq blessin (3) - 32 freq greasy (3) - 27 freq aless (3) - 26 freq |
glessfy (0) - 1 freq glessfi (1) - 1 freq glessfu (1) - 2 freq glessy (2) - 1 freq glassfu (2) - 1 freq glesses (3) - 96 freq glessin (3) - 1 freq gless (3) - 395 freq glessis (3) - 5 freq glossy (3) - 14 freq glossay (3) - 1 freq glassy (3) - 2 freq glessie (3) - 3 freq glasses (4) - 24 freq glaess (4) - 1 freq glassily (4) - 1 freq glosses (4) - 2 freq glassa (4) - 1 freq glaissy (4) - 1 freq glossin (4) - 4 freq blissfu (4) - 1 freq glissin (4) - 2 freq gloss (4) - 7 freq gliss (4) - 1 freq glosst (4) - 1 freq |
SoundEx code - G421 glassfu - 1 freq gleg-gabbit - 2 freq glessfy - 1 freq glasspirations - 1 freq goalkeeper - 4 freq glessfu - 2 freq g'lespie - 1 freq gillespie - 5 freq glacpin - 1 freq goalkeeper's - 1 freq glessfi - 1 freq gaelic-speaker - 1 freq gaelic-speakin - 1 freq gillies-brown - 1 freq gleg-fittit - 1 freq glescafication - 1 freq gaelic-speikin - 1 freq goalkeepers - 1 freq gllaihcb - 1 freq gallusbesum - 2 freq galluseffie - 5 freq gaelicbingo - 1 freq glasgowpauline - 1 freq glasgowpam - 1 freq glesga-based - 1 freq glasgowfilm - 1 freq golspie - 1 freq glasgowburns - 4 freq galcqhbmxd - 1 freq |
MetaPhone code - KLSF glassfu - 1 freq glessfy - 1 freq glessfu - 2 freq glessfi - 1 freq galluseffie - 5 freq |
GLESSFY |
Time to execute Levenshtein function - 0.194510 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.429077 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.031935 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.044735 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.001125 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. |