| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gashle (0) - 1 freq gabble (2) - 1 freq hushle (2) - 1 freq dachle (2) - 1 freq bachle (2) - 1 freq gantle (2) - 1 freq castle (2) - 153 freq gaggle (2) - 5 freq cassle (2) - 1 freq cashe (2) - 1 freq ashe (2) - 1 freq rashie (2) - 1 freq gamble (2) - 12 freq bastle (2) - 1 freq easle (2) - 2 freq hashie (2) - 2 freq hassle (2) - 20 freq mashles (2) - 1 freq gable (2) - 8 freq washte (2) - 1 freq gash (2) - 14 freq wachle (2) - 1 freq gale (2) - 64 freq glashie (2) - 1 freq ashley (2) - 9 freq |
gashle (0) - 1 freq gushel (3) - 1 freq cashley (3) - 2 freq gash (3) - 14 freq hushle (3) - 1 freq ashley (3) - 9 freq gushed (4) - 1 freq gushes (4) - 5 freq gaistly (4) - 1 freq galle (4) - 1 freq reeshle (4) - 10 freq gargle (4) - 3 freq gahler (4) - 1 freq apashley (4) - 4 freq gesh (4) - 1 freq gshd (4) - 1 freq garishly (4) - 1 freq gushin (4) - 4 freq gisli (4) - 6 freq shale (4) - 5 freq reishle (4) - 2 freq asshole (4) - 2 freq yaishly (4) - 1 freq gushet (4) - 2 freq gush (4) - 1 freq |
SoundEx code - G240 gisli - 6 freq 'gisli - 1 freq giggle - 20 freq gaggle - 5 freq google - 80 freq gazelle - 7 freq guzzle - 4 freq goggle - 1 freq geooesel - 1 freq geggle - 1 freq geegly - 1 freq googly - 3 freq gushel - 1 freq gashle - 1 freq gogol - 2 freq €œguzul - 4 freq guzul - 86 freq guzull - 1 freq |
MetaPhone code - KXL gushel - 1 freq cochlea - 2 freq gashle - 1 freq cashley - 2 freq |
GASHLE |
| Time to execute Levenshtein function - 0.283632 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.483560 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.030898 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.041514 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.001016 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. |