| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| glaurish (0) - 1 freq glaur's (2) - 1 freq garish (2) - 1 freq glaurie (2) - 7 freq glaurin (2) - 1 freq glaurs (2) - 1 freq flourish (2) - 23 freq langish (3) - 1 freq clannish (3) - 1 freq marish (3) - 1 freq fleerish (3) - 5 freq florish (3) - 1 freq parish (3) - 30 freq glarin (3) - 7 freq glaumin (3) - 1 freq lauras (3) - 4 freq bluish (3) - 6 freq glawrie (3) - 10 freq plampish (3) - 1 freq nourish (3) - 2 freq floorish (3) - 3 freq slaimish (3) - 3 freq fairish (3) - 1 freq lavish (3) - 2 freq blandish (3) - 1 freq |
glaurish (0) - 1 freq flourish (3) - 23 freq garish (3) - 1 freq glaurs (3) - 1 freq florish (4) - 1 freq glaursel (4) - 1 freq fleerish (4) - 5 freq floorish (4) - 3 freq glares (4) - 8 freq glaur's (4) - 1 freq glaurin (4) - 1 freq glaurie (4) - 7 freq glaiss (5) - 65 freq gaurs (5) - 2 freq marish (5) - 1 freq glaur (5) - 101 freq glaury (5) - 14 freq grush (5) - 1 freq glourin (5) - 1 freq glais (5) - 1 freq greyish (5) - 3 freq gleesh (5) - 1 freq goulash (5) - 2 freq gleers (5) - 1 freq glories (5) - 9 freq |
SoundEx code - G462 glouers - 1 freq glowers - 9 freq glares - 8 freq glaursel - 1 freq glorious - 59 freq 'glorious' - 1 freq glower's - 1 freq ghilarza - 1 freq galleries - 8 freq glories - 9 freq galeries' - 1 freq glaur's - 1 freq glawrious - 1 freq glaurish - 1 freq glurk - 1 freq gleers - 1 freq glaurs - 1 freq gallahersblues - 4 freq gailrosssnp - 8 freq gxlrcruuo - 1 freq gallers - 25 freq gloriously - 1 freq |
MetaPhone code - KLRX glaurish - 1 freq |
GLAURISH |
| Time to execute Levenshtein function - 0.231078 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.508360 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.031702 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.039127 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.000913 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. |