| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| glazier (0) - 1 freq glazie (1) - 5 freq glacier (1) - 2 freq blazer (2) - 8 freq glazed (2) - 15 freq brazier (2) - 5 freq crazier (2) - 1 freq glaumer (2) - 1 freq glaze (2) - 3 freq glazin (2) - 2 freq glaizie (2) - 5 freq grazer (2) - 1 freq clavier (2) - 1 freq glaciers (2) - 2 freq glabber (2) - 1 freq glazeen (2) - 1 freq glawed (3) - 1 freq uglier (3) - 1 freq plainer (3) - 3 freq glasgie (3) - 1 freq flakie (3) - 3 freq platie (3) - 2 freq claried (3) - 1 freq gledder (3) - 3 freq glar (3) - 7 freq |
glazier (0) - 1 freq glazie (2) - 5 freq glacier (2) - 2 freq glazin (3) - 2 freq grazer (3) - 1 freq glaze (3) - 3 freq glazeen (3) - 1 freq glaizie (3) - 5 freq glazed (3) - 15 freq blazer (3) - 8 freq glaumer (3) - 1 freq glaurie (4) - 7 freq glamour (4) - 29 freq glaur (4) - 101 freq glar (4) - 7 freq geezer (4) - 6 freq glorie (4) - 32 freq glower (4) - 60 freq gloir (4) - 1 freq guizer (4) - 4 freq gloze (4) - 1 freq glawrie (4) - 10 freq glaciers (4) - 2 freq clavier (4) - 1 freq crazier (4) - 1 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 - 138 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 |
GLAZIER |
| Time to execute Levenshtein function - 0.272636 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.450053 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.069455 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.074435 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.001143 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. |