| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| opon (0) - 1 freq apon (1) - 90 freq oon (1) - 2 freq open (1) - 735 freq opo (1) - 1 freq spon (1) - 1 freq ipon (1) - 16 freq vpon (1) - 1 freq upon (1) - 255 freq opin (1) - 9 freq pon (1) - 3 freq con (2) - 21 freq ikon (2) - 1 freq ops (2) - 1 freq oof (2) - 6 freq pow (2) - 41 freq opine (2) - 1 freq ihon (2) - 2 freq hopen (2) - 1 freq up'n (2) - 1 freq ope (2) - 3 freq ron (2) - 14 freq op (2) - 7 freq poo (2) - 18 freq spow (2) - 1 freq |
opon (0) - 1 freq upon (1) - 255 freq opin (1) - 9 freq ipon (1) - 16 freq pon (1) - 3 freq apon (1) - 90 freq open (1) - 735 freq upoan (2) - 7 freq ipn (2) - 1 freq pony (2) - 13 freq upn (2) - 1 freq epona (2) - 1 freq poon (2) - 2 freq pun (2) - 59 freq apun (2) - 2 freq apin (2) - 13 freq oapen (2) - 1 freq pin (2) - 37 freq apone (2) - 3 freq ypn (2) - 1 freq pan (2) - 137 freq pen (2) - 119 freq opine (2) - 1 freq vpon (2) - 1 freq apoun (2) - 1 freq |
SoundEx code - O150 open - 735 freq oven - 51 freq 'open - 5 freq 'opium - 1 freq oapen - 1 freq offen - 17 freq offin - 20 freq ovine - 1 freq oppin - 4 freq opin - 9 freq opium - 4 freq oppen - 31 freq oobin - 2 freq oven' - 1 freq 'open' - 1 freq obama - 3 freq oban - 3 freq opon - 1 freq ofen - 2 freq opine - 1 freq €˜open - 5 freq open-mou - 3 freq €˜opium - 1 freq open- - 1 freq ofÂ’n - 1 freq opinio - 1 freq obeyin - 1 freq oyvaym - 1 freq ovme - 1 freq |
MetaPhone code - OPN open - 735 freq 'open - 5 freq oapen - 1 freq oppin - 4 freq opin - 9 freq oppen - 31 freq 'open' - 1 freq opon - 1 freq opine - 1 freq €˜open - 5 freq open- - 1 freq opinio - 1 freq |
OPON |
| Time to execute Levenshtein function - 0.194876 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.360664 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.028846 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.037891 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.000917 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. |