| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oblivious (0) - 14 freq obvious (2) - 86 freq obleevious (2) - 1 freq oblivion (2) - 2 freq obliviously (2) - 1 freq malicious (3) - 1 freq religious (3) - 50 freq delicious (3) - 24 freq olivia's (3) - 1 freq obnoxious (3) - 1 freq delirious (3) - 3 freq velvous (4) - 1 freq deleicious (4) - 1 freq odious (4) - 4 freq behavious (4) - 1 freq oblique (4) - 2 freq cairious (4) - 1 freq ambitious (4) - 10 freq obveeous (4) - 1 freq oliviaj (4) - 1 freq opeinioun (4) - 4 freq obligin (4) - 6 freq previous (4) - 43 freq ubiqitous (4) - 1 freq blinfoul (4) - 1 freq |
oblivious (0) - 14 freq obleevious (2) - 1 freq obvious (3) - 86 freq obliviously (3) - 1 freq oblivion (3) - 2 freq behavious (5) - 1 freq olives (5) - 17 freq bolivians (5) - 1 freq obveeous (5) - 1 freq blairius (5) - 1 freq obliges (5) - 1 freq blasius (5) - 1 freq obnoxious (5) - 1 freq religious (5) - 50 freq malicious (5) - 1 freq delicious (5) - 24 freq olivia's (5) - 1 freq velvous (5) - 1 freq delirious (5) - 3 freq blis (6) - 1 freq bliss (6) - 59 freq blouse (6) - 18 freq bolivia (6) - 2 freq levies (6) - 1 freq blogs (6) - 9 freq |
SoundEx code - O141 oblivious - 14 freq obliviously - 1 freq oblivion - 2 freq obleevious - 1 freq oblfpwmxqg - 1 freq |
MetaPhone code - OBLFS oblivious - 14 freq obleevious - 1 freq |
OBLIVIOUS |
| Time to execute Levenshtein function - 0.220616 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.379874 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.026852 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.036773 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.000793 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. |