| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gospels (0) - 9 freq gospel (1) - 29 freq compels (2) - 1 freq gowpers (2) - 2 freq possels (2) - 8 freq dispels (2) - 1 freq tossels (2) - 1 freq gowpens (2) - 1 freq hostels (2) - 1 freq gowp's (3) - 1 freq novels (3) - 29 freq golders (3) - 3 freq rope's (3) - 1 freq gorie's (3) - 1 freq sels (3) - 7 freq goves (3) - 2 freq spews (3) - 5 freq godes (3) - 2 freq gosden (3) - 1 freq gypes (3) - 17 freq jowels (3) - 3 freq gushes (3) - 5 freq goers (3) - 3 freq compelt (3) - 1 freq goosers (3) - 2 freq |
gospels (0) - 9 freq gospel (2) - 29 freq dispels (3) - 1 freq spiels (4) - 2 freq gasps (4) - 7 freq speils (4) - 1 freq gowpens (4) - 1 freq hostels (4) - 1 freq gowpers (4) - 2 freq compels (4) - 1 freq possels (4) - 8 freq tossels (4) - 1 freq veshels (5) - 2 freq grapes (5) - 23 freq gushel (5) - 1 freq 'spells (5) - 1 freq garpel (5) - 1 freq chapels (5) - 2 freq spells (5) - 21 freq spees (5) - 1 freq gosleen (5) - 1 freq sowels (5) - 29 freq 'spell (5) - 3 freq bushels (5) - 1 freq gels (5) - 1 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 - KSPLS gospels - 9 freq |
GOSPELS |
| Time to execute Levenshtein function - 0.200677 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.342449 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.027492 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.038492 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.000852 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. |