| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| glenwelsh (0) - 2 freq gleesh (3) - 1 freq glenesk (3) - 1 freq glenkens (3) - 2 freq glenelg (3) - 1 freq euanwelsh (3) - 2 freq glebes (4) - 1 freq levels (4) - 66 freq glents (4) - 6 freq glegness (4) - 7 freq welsh (4) - 175 freq glens (4) - 44 freq levels' (4) - 1 freq bennels (4) - 1 freq lintels (4) - 2 freq plenish (4) - 6 freq leevels (4) - 1 freq penels (4) - 7 freq flannels (4) - 1 freq landels (4) - 1 freq feenesh (4) - 2 freq daeneesh (4) - 1 freq gleddens (4) - 1 freq fleesh (4) - 3 freq gleems (4) - 1 freq |
glenwelsh (0) - 2 freq euanwelsh (5) - 2 freq glenelg (6) - 1 freq greenwash (6) - 1 freq glenkens (6) - 2 freq gleesh (6) - 1 freq glenesk (6) - 1 freq glenogle (7) - 1 freq lentils (7) - 2 freq glenshee (7) - 11 freq gunnels (7) - 4 freq landels (7) - 1 freq greenwell (7) - 1 freq glowers (7) - 9 freq glances (7) - 13 freq ganesh (7) - 6 freq glen's (7) - 4 freq irvinewelsh (7) - 3 freq flannels (7) - 1 freq glents (7) - 6 freq glenn's (7) - 1 freq glens (7) - 44 freq glendale (7) - 3 freq glenda's (7) - 1 freq lintels (7) - 2 freq |
SoundEx code - G454 glenluce - 1 freq gilmilnscroft - 3 freq glumly - 1 freq gloomily - 2 freq glenelg - 1 freq glenlyon - 6 freq glenwelsh - 2 freq glenlivet - 4 freq glenlivetloon - 2 freq |
MetaPhone code - KLNWLX glenwelsh - 2 freq |
GLENWELSH |
| Time to execute Levenshtein function - 0.235689 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.427914 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.028216 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.038875 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.000859 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. |