| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| obvious (0) - 86 freq devious (2) - 4 freq obviously (2) - 110 freq invious (2) - 1 freq obveeous (2) - 1 freq envious (2) - 2 freq odious (2) - 4 freq oblivious (2) - 14 freq onions (3) - 17 freq obviouslie (3) - 1 freq tedious (3) - 1 freq virus (3) - 57 freq enxious (3) - 4 freq noxious (3) - 2 freq obvo (3) - 1 freq oblique (3) - 2 freq vous (3) - 6 freq ybius (3) - 1 freq ious (3) - 1 freq options (3) - 27 freq curious (3) - 74 freq scrious (3) - 1 freq vicious (3) - 17 freq unxious (3) - 1 freq obnoxious (3) - 1 freq |
obvious (0) - 86 freq obveeous (2) - 1 freq devious (3) - 4 freq obvs (3) - 4 freq envious (3) - 2 freq oblivious (3) - 14 freq obviously (3) - 110 freq invious (3) - 1 freq byous (4) - 48 freq ybius (4) - 1 freq brous (4) - 5 freq obleevious (4) - 1 freq vous (4) - 6 freq bous (4) - 3 freq oboils (4) - 1 freq odious (4) - 4 freq obviouslie (4) - 1 freq obvo (4) - 1 freq boobs (5) - 7 freq oobits (5) - 5 freq biebs (5) - 1 freq boils (5) - 4 freq boots (5) - 89 freq abidys (5) - 1 freq boies (5) - 1 freq |
SoundEx code - O120 offski - 6 freq office - 208 freq obvious - 86 freq oaffice - 8 freq offish - 12 freq oops - 18 freq oaps - 4 freq offies - 1 freq obveeous - 1 freq offess - 1 freq offs - 9 freq oaffish - 1 freq opaque - 6 freq office' - 1 freq obese - 8 freq offece - 1 freq offce - 2 freq offys - 8 freq offiece - 3 freq offees - 1 freq offaice - 11 freq oobag - 1 freq opus - 2 freq opsi - 1 freq oafice - 6 freq €˜oops - 1 freq ops - 1 freq oepg - 1 freq obusy - 1 freq ofkg - 1 freq ofc - 1 freq oppkks - 1 freq ofjk - 1 freq o'bugs - 1 freq o'pish - 1 freq opc - 1 freq oavzje - 1 freq offsky - 2 freq ooppssssss - 1 freq obes - 1 freq oppose - 2 freq obs - 1 freq obvs - 4 freq obg - 1 freq oevci - 2 freq obz - 1 freq opps - 1 freq oafs - 1 freq |
MetaPhone code - OBFS obvious - 86 freq obveeous - 1 freq obvs - 4 freq |
OBVIOUS |
| Time to execute Levenshtein function - 0.293985 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.470006 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.027175 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.036863 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.000764 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. |