| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gespan (0) - 1 freq gaspan (1) - 1 freq bespak (2) - 1 freq respon (2) - 1 freq german (2) - 160 freq peepan (2) - 3 freq keepan (2) - 12 freq gey-an (2) - 1 freq gellan (2) - 7 freq gappan (2) - 1 freq gaspin (2) - 13 freq gean (2) - 10 freq glesgan (2) - 1 freq geian (2) - 1 freq geckan (2) - 1 freq geyran (2) - 1 freq gupan (2) - 1 freq vespa (2) - 2 freq grespin (2) - 3 freq messan (2) - 5 freq gettan (2) - 39 freq nestan (2) - 1 freq getan (2) - 1 freq respin (2) - 1 freq testan (2) - 1 freq |
gespan (0) - 1 freq gaspan (1) - 1 freq gaspin (2) - 13 freq gappan (3) - 1 freq grespin (3) - 3 freq gupan (3) - 1 freq respin (3) - 1 freq raspan (3) - 1 freq span (3) - 17 freq respon (3) - 1 freq rispin (4) - 1 freq spin (4) - 65 freq spain (4) - 55 freq gampin (4) - 1 freq gowpen (4) - 5 freq gosden (4) - 1 freq gopin (4) - 1 freq aspen (4) - 10 freq 'spain (4) - 2 freq seepin (4) - 15 freq gasps (4) - 7 freq gaspin' (4) - 1 freq gropin (4) - 2 freq goupin (4) - 1 freq respone (4) - 1 freq |
SoundEx code - G215 gaspin - 13 freq gaspin' - 1 freq gossipin - 3 freq gaspan - 1 freq gossipan - 1 freq gespan - 1 freq giacobinids - 1 freq goosepimples - 1 freq gossiping - 2 freq goixbmu - 1 freq goosebumps - 2 freq guiseppim - 6 freq gasping - 2 freq gixeubnv - 1 freq |
MetaPhone code - JSPN gespan - 1 freq jazzpiano - 1 freq |
GESPAN |
| Time to execute Levenshtein function - 0.202379 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.524406 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.028469 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.070865 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.000890 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. |