| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| opp (0) - 2 freq opl (1) - 1 freq ropp (1) - 7 freq oop (1) - 2 freq op (1) - 7 freq app (1) - 46 freq opps (1) - 1 freq hopp (1) - 5 freq osp (1) - 2 freq ohp (1) - 1 freq opc (1) - 1 freq ops (1) - 1 freq oup (1) - 1 freq sopp (1) - 1 freq rpp (1) - 1 freq lopp (1) - 1 freq opo (1) - 1 freq ope (1) - 3 freq copp (1) - 1 freq obp (1) - 1 freq opt (1) - 2 freq pp (1) - 50 freq vpp (1) - 1 freq tcp (2) - 5 freq pn (2) - 4 freq |
opp (0) - 2 freq app (1) - 46 freq pp (1) - 50 freq poop (2) - 3 freq pop (2) - 82 freq pip (2) - 7 freq vpp (2) - 1 freq obp (2) - 1 freq opt (2) - 2 freq pup (2) - 37 freq ppe (2) - 3 freq pope (2) - 26 freq appy (2) - 1 freq eppy (2) - 1 freq pep (2) - 3 freq copp (2) - 1 freq ppy (2) - 1 freq pap (2) - 21 freq poap (2) - 1 freq hopp (2) - 5 freq ropp (2) - 7 freq opl (2) - 1 freq opc (2) - 1 freq opps (2) - 1 freq op (2) - 7 freq |
SoundEx code - O100 off - 546 freq of - 4117 freq oaf - 51 freq ouf - 1 freq oof - 6 freq oaff - 110 freq 'of - 17 freq oo've - 3 freq oba - 2 freq obey - 8 freq ov - 59 freq obe - 2 freq oaap - 1 freq ob - 8 freq oaffy - 3 freq oaffae - 2 freq ope - 3 freq oboe - 1 freq ouff - 1 freq oop - 2 freq ove - 1 freq ofhe - 1 freq owef - 1 freq o'view - 2 freq owf - 1 freq offae - 1 freq ovey - 1 freq 'of' - 1 freq oob - 1 freq ohff - 1 freq offy - 2 freq €œof - 6 freq op - 7 freq offie - 2 freq €˜of - 3 freq €™ope - 2 freq offay - 1 freq oov - 8 freq €™of - 3 freq owuhv - 1 freq opo - 1 freq obvo - 1 freq ooof - 1 freq opyu - 1 freq obf - 1 freq obv - 4 freq obbv - 1 freq ohp - 1 freq ofh - 1 freq opui - 1 freq obh - 2 freq oup - 1 freq oupa - 1 freq oove - 1 freq opp - 2 freq obp - 1 freq |
MetaPhone code - OP oaap - 1 freq ope - 3 freq oop - 2 freq op - 7 freq €™ope - 2 freq opo - 1 freq ohp - 1 freq opui - 1 freq oup - 1 freq oupa - 1 freq opp - 2 freq |
OPP |
| Time to execute Levenshtein function - 0.226957 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.330373 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.027589 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.037530 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.000882 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. |