| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| opui (0) - 1 freq pui (1) - 1 freq opus (1) - 2 freq oui (1) - 5 freq opsi (1) - 1 freq epub (2) - 1 freq tui (2) - 2 freq sput (2) - 8 freq oi (2) - 18 freq hui (2) - 1 freq puj (2) - 1 freq onli (2) - 40 freq ops (2) - 1 freq pu (2) - 94 freq op (2) - 7 freq spug (2) - 1 freq spi (2) - 1 freq ouk (2) - 16 freq pul (2) - 6 freq puil (2) - 37 freq pur (2) - 5 freq blui (2) - 1 freq open (2) - 735 freq spu (2) - 1 freq pus (2) - 17 freq |
opui (0) - 1 freq pui (1) - 1 freq oup (2) - 1 freq pu (2) - 94 freq pai (2) - 1 freq opo (2) - 1 freq puy (2) - 3 freq op (2) - 7 freq ope (2) - 3 freq oui (2) - 5 freq opus (2) - 2 freq opsi (2) - 1 freq opyu (2) - 1 freq poi (2) - 1 freq pi (2) - 7 freq opin (3) - 9 freq puni (3) - 25 freq oni (3) - 1 freq jpu (3) - 1 freq pug (3) - 6 freq oki (3) - 5 freq poe (3) - 114 freq pe (3) - 27 freq opef (3) - 1 freq ouf (3) - 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 |
OPUI |
| Time to execute Levenshtein function - 0.202087 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.340539 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.027741 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.040562 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.000943 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. |