| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| glassily (0) - 1 freq glassy (2) - 2 freq classic (3) - 47 freq ghaistly (3) - 13 freq grissly (3) - 1 freq krassivy (3) - 1 freq glessis (3) - 5 freq glansin (3) - 7 freq grossly (3) - 1 freq lassies (3) - 308 freq glaikitly (3) - 1 freq ghastly (3) - 3 freq lassie' (3) - 1 freq gaistly (3) - 1 freq grassic (3) - 8 freq clumsily (3) - 4 freq glasgie (3) - 1 freq lazily (3) - 12 freq hastily (3) - 22 freq clossly (3) - 2 freq aisily (3) - 1 freq glarinly (3) - 1 freq glashie (3) - 1 freq easily (3) - 60 freq poassibly (3) - 1 freq |
glassily (0) - 1 freq glassy (3) - 2 freq glessfy (4) - 1 freq glass (4) - 80 freq glessy (4) - 1 freq glossin (4) - 4 freq glassfu (4) - 1 freq glessie (4) - 3 freq glossy (4) - 14 freq clossly (4) - 2 freq glessin (4) - 1 freq glasses (4) - 24 freq grissly (4) - 1 freq glassa (4) - 1 freq glossay (4) - 1 freq glossary (4) - 15 freq glessis (4) - 5 freq glissin (4) - 2 freq grossly (4) - 1 freq glaissy (4) - 1 freq gutsily (5) - 1 freq lastly (5) - 5 freq gladly (5) - 7 freq glessfu (5) - 2 freq lassy (5) - 3 freq |
SoundEx code - G424 glegly - 18 freq glegly-gabbit - 2 freq glassily - 1 freq gleglie - 3 freq glessless - 1 freq glacial - 2 freq gallusly - 3 freq gleg-like - 1 freq galashiels - 7 freq gallogly-swan - 2 freq gallus-lik - 1 freq gallowayglens - 3 freq glasgowlangs - 9 freq galgael - 1 freq glasgowlib - 8 freq glasgowlee - 1 freq |
MetaPhone code - KLSL closely - 21 freq glassily - 1 freq clossly - 2 freq gallusly - 3 freq clossli - 2 freq coleslaw - 1 freq kilsally - 2 freq kellsley - 3 freq |
GLASSILY |
| Time to execute Levenshtein function - 0.900832 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 - 1.794343 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.115232 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.202658 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.000894 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. |