Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ops (0) - 1 freq opsi (1) - 1 freq hps (1) - 1 freq opl (1) - 1 freq opp (1) - 2 freq opps (1) - 1 freq cops (1) - 3 freq rps (1) - 17 freq opc (1) - 1 freq jps (1) - 3 freq ots (1) - 2 freq ons (1) - 1 freq oes (1) - 2 freq oos (1) - 1 freq dps (1) - 1 freq yps (1) - 1 freq opo (1) - 1 freq ope (1) - 3 freq oaps (1) - 4 freq fps (1) - 1 freq hops (1) - 2 freq tops (1) - 21 freq o's (1) - 48 freq op (1) - 7 freq ups (1) - 22 freq |
ops (0) - 1 freq ps (1) - 68 freq oaps (1) - 4 freq ups (1) - 22 freq opus (1) - 2 freq oops (1) - 18 freq ips (1) - 2 freq yps (1) - 1 freq opsi (1) - 1 freq poes (2) - 1 freq pas (2) - 18 freq bps (2) - 1 freq pops (2) - 25 freq oys (2) - 3 freq pse (2) - 1 freq obs (2) - 1 freq mps (2) - 31 freq vps (2) - 1 freq pps (2) - 1 freq pous (2) - 1 freq psa (2) - 3 freq psy (2) - 1 freq ipso (2) - 2 freq pos (2) - 2 freq yips (2) - 1 freq |
SoundEx code - O120 offski - 6 freq office - 208 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 |
OPS |
Time to execute Levenshtein function - 0.260125 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.402067 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.028715 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.040824 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. |