| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oban (0) - 3 freq oman (1) - 2 freq oba (1) - 2 freq oan (1) - 5755 freq o'an (1) - 1 freq ban (1) - 48 freq hoban (1) - 5 freq o-an (1) - 1 freq abaen (2) - 1 freq okay (2) - 62 freq ooin (2) - 1 freq span (2) - 17 freq open (2) - 719 freq bah (2) - 4 freq caan (2) - 2 freq awan (2) - 1 freq ona (2) - 14 freq san (2) - 44 freq saan (2) - 1 freq dbn (2) - 1 freq bad (2) - 925 freq mean (2) - 939 freq an (2) - 76376 freq €˜an (2) - 19 freq qbal (2) - 1 freq |
oban (0) - 3 freq ban (1) - 48 freq bon (2) - 13 freq byn (2) - 2 freq abane (2) - 28 freq bun (2) - 59 freq abain (2) - 23 freq abun (2) - 3 freq bin (2) - 954 freq abin (2) - 43 freq bany (2) - 1 freq baen (2) - 8 freq ben (2) - 605 freq baun (2) - 18 freq bn (2) - 7 freq ubun (2) - 1 freq oobin (2) - 2 freq abon (2) - 1 freq bean (2) - 41 freq hoban (2) - 5 freq o-an (2) - 1 freq abaen (2) - 1 freq bain (2) - 77 freq o'an (2) - 1 freq bane (2) - 81 freq |
SoundEx code - O150 open - 719 freq oven - 51 freq 'open - 4 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 - OBN oobin - 2 freq oban - 3 freq |
OBAN |
| Time to execute Levenshtein function - 0.189310 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.386113 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.029147 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.038338 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.000810 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. |