Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
opo (0) - 1 freq ooo (1) - 23 freq omo (1) - 1 freq oto (1) - 1 freq oxo (1) - 1 freq ipo (1) - 56 freq oo (1) - 422 freq ono (1) - 3 freq opl (1) - 1 freq ojo (1) - 3 freq upo (1) - 67 freq opp (1) - 2 freq gpo (1) - 4 freq opc (1) - 1 freq odo (1) - 1 freq po (1) - 21 freq opt (1) - 2 freq apo (1) - 150 freq oro (1) - 1 freq op (1) - 7 freq opon (1) - 1 freq spo (1) - 1 freq ozo (1) - 1 freq qpo (1) - 1 freq ops (1) - 1 freq |
opo (0) - 1 freq apo (1) - 150 freq op (1) - 7 freq upo (1) - 67 freq ope (1) - 3 freq po (1) - 21 freq ipo (1) - 56 freq apio (2) - 1 freq ipe (2) - 1 freq opyu (2) - 1 freq pou (2) - 53 freq yp (2) - 4 freq apy (2) - 1 freq apa (2) - 2 freq apao (2) - 1 freq oup (2) - 1 freq poo (2) - 18 freq oupa (2) - 1 freq opui (2) - 1 freq ep (2) - 10 freq ape (2) - 5 freq pu (2) - 94 freq upa (2) - 2 freq ap (2) - 94 freq ipa (2) - 1 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 |
OPO |
Time to execute Levenshtein function - 0.191742 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.345190 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.031901 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.042301 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.001223 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. |