| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| galashiels (0) - 7 freq galshiks (3) - 2 freq glashie (3) - 1 freq galaxies (3) - 8 freq lashes (4) - 7 freq 'lassies (4) - 2 freq galleries (4) - 8 freq gulshicks (4) - 2 freq lasgies (4) - 3 freq alchies (4) - 1 freq splashes (4) - 3 freq plashes (4) - 1 freq galoshans (4) - 1 freq gnashes (4) - 1 freq lashins (4) - 3 freq maeshies (4) - 1 freq ghoasties (4) - 1 freq shiels (4) - 4 freq ralphies (4) - 1 freq glasgie (4) - 1 freq gansies (4) - 3 freq lassies (4) - 296 freq salaries (4) - 3 freq splashie (4) - 2 freq gnashers (4) - 1 freq |
galashiels (0) - 7 freq galshiks (4) - 2 freq galoshans (5) - 1 freq glashie (5) - 1 freq gnashers (6) - 1 freq shiels (6) - 4 freq lashins (6) - 3 freq glasses (6) - 23 freq ganshes (6) - 11 freq glassily (6) - 1 freq clashes (6) - 2 freq flashes (6) - 23 freq gnashes (6) - 1 freq eelashes (6) - 4 freq plashes (6) - 1 freq galaxies (6) - 8 freq gulshicks (6) - 2 freq lashes (6) - 7 freq gushel (7) - 1 freq fleshers (7) - 3 freq eaglesfield (7) - 1 freq glaisses (7) - 21 freq relishes (7) - 1 freq gullies (7) - 3 freq glessie (7) - 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 - KLXLS galashiels - 7 freq |
GALASHIELS |
| Time to execute Levenshtein function - 0.425375 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.595968 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.062697 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.037931 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. |