| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gospel (0) - 29 freq gospels (1) - 9 freq gosden (2) - 1 freq compel (2) - 1 freq gushel (2) - 1 freq hostel (2) - 14 freq gowpen (2) - 4 freq gowped (2) - 5 freq tossel (2) - 1 freq gooped (2) - 1 freq gorbel (2) - 1 freq gomper (2) - 3 freq garpel (2) - 1 freq gasped (2) - 21 freq dispel (2) - 4 freq gode (3) - 5 freq ousel (3) - 1 freq speil (3) - 17 freq 'spell (3) - 3 freq hesped (3) - 1 freq speal (3) - 1 freq veshel (3) - 1 freq wisped (3) - 1 freq spee (3) - 1 freq golder (3) - 1 freq |
gospel (0) - 29 freq gospels (2) - 9 freq dispel (3) - 4 freq gushel (3) - 1 freq gasped (3) - 21 freq garpel (3) - 1 freq gaspin (4) - 13 freq gespan (4) - 1 freq speal (4) - 1 freq gaspit (4) - 5 freq gasp (4) - 37 freq speel (4) - 18 freq soupil (4) - 3 freq spiel (4) - 19 freq sipel (4) - 1 freq byspiel (4) - 1 freq spael (4) - 1 freq gaspan (4) - 1 freq spl (4) - 4 freq gasps (4) - 7 freq gooped (4) - 1 freq compel (4) - 1 freq gorbel (4) - 1 freq speil (4) - 17 freq hostel (4) - 14 freq |
SoundEx code - G214 gospel - 29 freq gowkflooers - 1 freq gas-filled - 1 freq gospels - 9 freq gospellin - 1 freq guessable - 1 freq |
MetaPhone code - KSPL gospel - 29 freq |
GOSPEL |
| Time to execute Levenshtein function - 0.210659 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.331149 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.027192 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.037522 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.000822 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. |