| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oops (0) - 18 freq pops (1) - 26 freq hoops (1) - 19 freq oaps (1) - 4 freq oohs (1) - 1 freq coops (1) - 1 freq loops (1) - 4 freq oop (1) - 2 freq oos (1) - 1 freq soops (1) - 1 freq tops (1) - 21 freq cops (1) - 3 freq ops (1) - 1 freq opps (1) - 1 freq sops (1) - 2 freq hops (1) - 2 freq ocps (1) - 1 freq nops (1) - 1 freq oors (1) - 357 freq oots (1) - 23 freq bols (2) - 1 freq qois (2) - 1 freq soo's (2) - 3 freq pos (2) - 2 freq loss (2) - 200 freq |
oops (0) - 18 freq oaps (1) - 4 freq ops (1) - 1 freq yips (2) - 1 freq aps (2) - 1 freq pois (2) - 1 freq oots (2) - 23 freq pos (2) - 2 freq ups (2) - 24 freq yps (2) - 1 freq pous (2) - 1 freq ips (2) - 2 freq opus (2) - 2 freq poes (2) - 1 freq poys (2) - 1 freq oors (2) - 357 freq yaps (2) - 1 freq ps (2) - 69 freq opsi (2) - 1 freq hops (2) - 2 freq loops (2) - 4 freq soops (2) - 1 freq sops (2) - 2 freq cops (2) - 3 freq opps (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 - OPS oops - 18 freq oaps - 4 freq opus - 2 freq opsi - 1 freq €˜oops - 1 freq ops - 1 freq ooppssssss - 1 freq oppose - 2 freq opps - 1 freq |
OOPS |
| Time to execute Levenshtein function - 0.389774 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.490868 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.027604 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.069880 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.000996 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. |