| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oppen (0) - 31 freq oapen (1) - 1 freq oppin (1) - 4 freq appen (1) - 25 freq toppen (1) - 1 freq open (1) - 735 freq oppens (1) - 4 freq peen (2) - 12 freq ripen (2) - 8 freq ogden (2) - 2 freq opted (2) - 5 freq outen (2) - 7 freq 'apen (2) - 2 freq oen (2) - 5 freq oapens (2) - 1 freq topper (2) - 12 freq 'appen (2) - 1 freq opp (2) - 2 freq offen (2) - 17 freq toppin (2) - 5 freq appin (2) - 2 freq ope (2) - 3 freq open- (2) - 1 freq upper (2) - 55 freq olden (2) - 1 freq |
oppen (0) - 31 freq appen (1) - 25 freq oppin (1) - 4 freq yappen (2) - 5 freq appin (2) - 2 freq uppin (2) - 1 freq open (2) - 735 freq oapen (2) - 1 freq oppens (2) - 4 freq toppen (2) - 1 freq yappan (3) - 1 freq oppint (3) - 2 freq pappen (3) - 1 freq 'open (3) - 5 freq soppin (3) - 1 freq wuppen (3) - 1 freq suppen (3) - 1 freq hopen (3) - 1 freq lippen (3) - 69 freq coupen (3) - 1 freq gappen (3) - 2 freq moppin (3) - 2 freq happen (3) - 386 freq opin (3) - 9 freq papeno (3) - 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 |
OPPEN |
| Time to execute Levenshtein function - 0.195792 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.357610 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.027528 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.038550 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.000839 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. |