| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oobag (0) - 1 freq oora (2) - 1 freq oba (2) - 2 freq morag (2) - 47 freq ootac (2) - 1 freq obg (2) - 1 freq oougg (2) - 1 freq boba (2) - 2 freq doag (2) - 53 freq oo'ae (2) - 1 freq boag (2) - 10 freq oonagh (2) - 3 freq tobar (2) - 2 freq oobed (2) - 1 freq torag (2) - 1 freq oob (2) - 1 freq oota (2) - 54 freq oban (2) - 3 freq hoban (2) - 5 freq hoag (2) - 3 freq ootae (2) - 90 freq oag (2) - 2 freq ooa (2) - 1 freq bag (2) - 334 freq 'bag (2) - 2 freq |
oobag (0) - 1 freq boag (2) - 10 freq bag (2) - 334 freq obg (2) - 1 freq oag (3) - 2 freq bug (3) - 57 freq ubg (3) - 4 freq oban (3) - 3 freq bg (3) - 5 freq 'bag (3) - 2 freq ebg (3) - 1 freq beag (3) - 1 freq big (3) - 2545 freq oobin (3) - 2 freq oob (3) - 1 freq hoag (3) - 3 freq oougg (3) - 1 freq baag (3) - 68 freq bog (3) - 58 freq oba (3) - 2 freq boba (3) - 2 freq doag (3) - 53 freq beg (3) - 76 freq abg (3) - 1 freq oobed (3) - 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 - OBK oobag - 1 freq obg - 1 freq |
OOBAG |
| Time to execute Levenshtein function - 0.221330 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.389644 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.029263 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.036996 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.000943 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. |