| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| deviously (0) - 1 freq devious (2) - 4 freq dubiously (2) - 1 freq enviously (2) - 1 freq previously (2) - 3 freq obviously (2) - 110 freq seriously (2) - 72 freq 'obviously (3) - 1 freq anxiously (3) - 38 freq piously (3) - 3 freq perilously (3) - 1 freq curiously (3) - 6 freq obviously' (3) - 1 freq deliciously (3) - 1 freq furiously (3) - 6 freq pervously (3) - 1 freq nervously (3) - 31 freq variously (3) - 2 freq jealously (3) - 3 freq obvious (4) - 86 freq obliviously (4) - 2 freq envious (4) - 2 freq gloriously (4) - 1 freq invious (4) - 1 freq deviltry (4) - 1 freq |
deviously (0) - 1 freq enviously (3) - 1 freq obviously (3) - 110 freq devious (3) - 4 freq dubiously (3) - 1 freq seriously (4) - 72 freq previously (4) - 3 freq devisin (5) - 7 freq deisle (5) - 1 freq jealously (5) - 3 freq devaul (5) - 9 freq devisit (5) - 4 freq variously (5) - 2 freq devise (5) - 2 freq devil (5) - 35 freq devised (5) - 1 freq obviouslie (5) - 1 freq furiously (5) - 6 freq obviously' (5) - 1 freq deliciously (5) - 1 freq nervously (5) - 31 freq piously (5) - 3 freq curiously (5) - 6 freq pervously (5) - 1 freq 'obviously (5) - 1 freq |
SoundEx code - D124 dubiously - 1 freq difficulties - 16 freq difficult - 72 freq difficulty - 25 freq deeffikwalties - 1 freq deefikwalties - 1 freq diffickwalt - 1 freq diffeekwalty - 2 freq difficulties' - 1 freq dubskelper - 16 freq dubskelper' - 1 freq 'dubskelper - 1 freq dubskelper's - 1 freq deiffekwalties - 3 freq deificulty - 1 freq defeekwalt - 1 freq 'difficult' - 1 freq diffeequalty - 1 freq deeficulty - 3 freq deifficult - 5 freq deviously - 1 freq deeficult - 5 freq deifficulty - 1 freq deeficulties - 1 freq deiffekwalt - 6 freq deiffekwaltie - 2 freq deifficulties - 1 freq debacle - 2 freq dífficulties - 2 freq defeeckwulty - 1 freq devihighlander - 1 freq dubhglasturner - 1 freq |
MetaPhone code - TFSL deviously - 1 freq |
DEVIOUSLY |
| Time to execute Levenshtein function - 0.190681 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.375055 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.028220 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.039212 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.000888 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. |