| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| obscenely (0) - 3 freq obscene (2) - 13 freq scenery (3) - 16 freq ogecebel (4) - 1 freq seely (4) - 4 freq sleely (4) - 1 freq steely (4) - 3 freq obscured (4) - 2 freq scene's (4) - 1 freq raicently (4) - 20 freq scene (4) - 126 freq scene' (4) - 1 freq obscure (4) - 7 freq openly (4) - 11 freq bienly (4) - 7 freq oppenly (4) - 1 freq descency (4) - 1 freq obscuret (4) - 2 freq obscures (4) - 1 freq obediently (4) - 4 freq obveesly (4) - 4 freq recently (4) - 78 freq sincerely (4) - 8 freq serenely (4) - 6 freq scenes (4) - 46 freq |
obscenely (0) - 3 freq obscene (3) - 13 freq scenery (5) - 16 freq bienly (6) - 7 freq obscure (6) - 7 freq descency (6) - 1 freq serenely (6) - 6 freq scene' (6) - 1 freq obscures (6) - 1 freq obscuret (6) - 2 freq scenes (6) - 46 freq obscured (6) - 2 freq scene (6) - 126 freq senile (7) - 1 freq absurdly (7) - 1 freq scowly (7) - 1 freq scones (7) - 48 freq beinly (7) - 1 freq scael (7) - 4 freq absconded (7) - 1 freq muscly (7) - 4 freq secondly (7) - 4 freq bairnly (7) - 1 freq scully (7) - 2 freq schiele (7) - 1 freq |
SoundEx code - O125 obscene - 13 freq obscenities - 2 freq offcn - 1 freq oohyafuckin - 1 freq obscenely - 3 freq off-chance - 1 freq ovey-somethin - 1 freq opposin - 3 freq opposing - 2 freq obviousness - 1 freq ofcom - 5 freq oybxmv - 1 freq obknit - 1 freq ofzm - 1 freq ophusnnk - 1 freq ofjnzg - 1 freq opscmh - 1 freq |
MetaPhone code - OBSNL obscenely - 3 freq |
OBSCENELY |
| Time to execute Levenshtein function - 0.184512 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.493555 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.068888 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.070229 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.001280 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. |