Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
opyu (0) - 1 freq hyu (2) - 1 freq opef (2) - 1 freq spu (2) - 1 freq mpy (2) - 1 freq op (2) - 7 freq ope (2) - 3 freq py (2) - 3 freq opc (2) - 1 freq oyl (2) - 2 freq opps (2) - 1 freq fpu (2) - 1 freq ou (2) - 17 freq oru (2) - 1 freq kyu (2) - 1 freq opsi (2) - 1 freq opium (2) - 4 freq mxyu (2) - 1 freq opus (2) - 2 freq apyc (2) - 1 freq opui (2) - 1 freq dopyt (2) - 1 freq opt (2) - 2 freq ipyb (2) - 1 freq oys (2) - 3 freq |
opyu (0) - 1 freq pou (2) - 53 freq pye (2) - 52 freq pu (2) - 94 freq opui (2) - 1 freq py (2) - 3 freq apy (2) - 1 freq peu (2) - 1 freq ope (2) - 3 freq opo (2) - 1 freq op (2) - 7 freq pia (3) - 3 freq pee (3) - 34 freq ipo (3) - 56 freq piy (3) - 2 freq puy (3) - 3 freq apio (3) - 1 freq paa (3) - 12 freq apae (3) - 4 freq opon (3) - 1 freq yu (3) - 40 freq jpu (3) - 1 freq pyt (3) - 2 freq tpu (3) - 1 freq pey (3) - 249 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 - OPY opyu - 1 freq |
OPYU |
Time to execute Levenshtein function - 0.196639 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.374627 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.028546 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.039829 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.000878 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. |