| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| obese (0) - 8 freq obes (1) - 1 freq bese (1) - 2 freq oese (1) - 4 freq obvs (2) - 4 freq aese (2) - 8 freq oeses (2) - 1 freq rese (2) - 1 freq beve (2) - 1 freq beese (2) - 5 freq base (2) - 39 freq obs (2) - 1 freq bene (2) - 106 freq bse (2) - 4 freq reese (2) - 10 freq eese (2) - 107 freq owes (2) - 4 freq bease (2) - 58 freq bede (2) - 1 freq bes' (2) - 16 freq oboe (2) - 1 freq geese (2) - 42 freq bes (2) - 315 freq ones (2) - 31 freq bose (2) - 19 freq |
obese (0) - 8 freq bese (1) - 2 freq obes (1) - 1 freq bse (2) - 4 freq obs (2) - 1 freq abuse (2) - 46 freq bose (2) - 19 freq baese (2) - 1 freq bes (2) - 315 freq bease (2) - 58 freq base (2) - 39 freq abase (2) - 1 freq beese (2) - 5 freq obusy (2) - 1 freq oese (2) - 4 freq boose (3) - 2 freq ese (3) - 2 freq busy (3) - 230 freq bees (3) - 46 freq beisie (3) - 3 freq baes (3) - 17 freq bos (3) - 3 freq giese (3) - 2 freq obeyed (3) - 4 freq bete (3) - 4 freq |
SoundEx code - O120 offski - 6 freq office - 216 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 - OBS obese - 8 freq obusy - 1 freq obes - 1 freq obs - 1 freq obz - 1 freq |
OBESE |
| Time to execute Levenshtein function - 0.222380 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.335119 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.027542 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.036838 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.000930 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. |