Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
glossary (0) - 15 freq glossary' (1) - 1 freq glossay (1) - 1 freq grossars (2) - 1 freq glossy (2) - 12 freq grossly (3) - 1 freq glosst (3) - 1 freq glossed (3) - 2 freq glessy (3) - 1 freq rosary (3) - 5 freq emissary (3) - 2 freq gossipy (3) - 1 freq flossy (3) - 1 freq closser (3) - 13 freq glossaries (3) - 4 freq glassily (3) - 1 freq glosses (3) - 2 freq glessfy (3) - 1 freq glossin (3) - 4 freq clossly (3) - 2 freq glesgay (3) - 1 freq glassy (3) - 2 freq glistery (3) - 1 freq glassa (3) - 1 freq gloss (3) - 7 freq |
glossary (0) - 15 freq glossay (2) - 1 freq glossary' (2) - 1 freq glossy (3) - 12 freq glossin (4) - 4 freq glessfy (4) - 1 freq glosses (4) - 2 freq glassy (4) - 2 freq gloss (4) - 7 freq elosser (4) - 1 freq glossaries (4) - 4 freq glassa (4) - 1 freq glistery (4) - 1 freq glassily (4) - 1 freq glossed (4) - 2 freq glosst (4) - 1 freq grossars (4) - 1 freq closser (4) - 13 freq glessy (4) - 1 freq glesses (5) - 96 freq slessor (5) - 4 freq glassfu (5) - 1 freq glessfi (5) - 1 freq glissin (5) - 2 freq glessfu (5) - 2 freq |
SoundEx code - G426 glegger - 2 freq gallacher - 14 freq gless-grien - 1 freq glaciers - 2 freq glossary - 15 freq glaigerin - 1 freq glossaries - 4 freq gilchrist - 3 freq glacier - 2 freq gallagher - 4 freq glossary' - 1 freq gillgreeny - 1 freq glasgowworlds - 2 freq gilesgraeme - 5 freq gaelicroadsign - 1 freq ggljrvkv - 1 freq glazier - 1 freq |
MetaPhone code - KLSR closer - 134 freq cloaser - 5 freq closure - 3 freq closser - 13 freq clausura - 1 freq glossary - 15 freq glacier - 2 freq glossary' - 1 freq calzer - 1 freq glazier - 1 freq |
GLOSSARY |
Time to execute Levenshtein function - 0.187434 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.368044 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.027342 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.036989 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.000844 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. |