| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| obz (0) - 1 freq obs (1) - 1 freq dbz (1) - 1 freq o'z (1) - 6 freq obh (1) - 2 freq abz (1) - 17 freq bz (1) - 2 freq oba (1) - 2 freq ob (1) - 8 freq obf (1) - 1 freq oz (1) - 15 freq obg (1) - 1 freq obe (1) - 2 freq obp (1) - 1 freq osz (1) - 1 freq otz (1) - 1 freq obv (1) - 4 freq oqy (2) - 1 freq obes (2) - 1 freq ecz (2) - 1 freq yiz (2) - 3 freq ebb (2) - 27 freq orb (2) - 2 freq ool (2) - 8 freq taz (2) - 21 freq |
obz (0) - 1 freq abz (1) - 17 freq bz (1) - 2 freq bez (2) - 1 freq boz (2) - 2 freq obv (2) - 4 freq otz (2) - 1 freq bza (2) - 1 freq biz (2) - 8 freq boyz (2) - 11 freq boiz (2) - 6 freq osz (2) - 1 freq boaz (2) - 16 freq abiz (2) - 1 freq obf (2) - 1 freq o'z (2) - 6 freq obh (2) - 2 freq oz (2) - 15 freq oba (2) - 2 freq obp (2) - 1 freq obg (2) - 1 freq obe (2) - 2 freq dbz (2) - 1 freq ob (2) - 8 freq obs (2) - 1 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 |
OBZ |
| Time to execute Levenshtein function - 0.201119 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.341703 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.031003 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.004138 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. |