| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oobin (0) - 2 freq bobin (1) - 1 freq ookin (1) - 1 freq ootin (1) - 5 freq ooin (1) - 1 freq robin (1) - 196 freq oo-in (1) - 1 freq oozin (1) - 3 freq 'bin (2) - 1 freq hoban (2) - 5 freq borin (2) - 46 freq doin (2) - 75 freq hoolin (2) - 6 freq cobain (2) - 1 freq 'odin (2) - 1 freq goblin (2) - 9 freq gomin (2) - 21 freq powin (2) - 4 freq robina (2) - 1 freq zoomin (2) - 6 freq poodin (2) - 10 freq bowin (2) - 8 freq oolit (2) - 2 freq robbin (2) - 6 freq oob (2) - 1 freq |
oobin (0) - 2 freq bouin (2) - 5 freq oban (2) - 3 freq bin (2) - 971 freq abin (2) - 43 freq oozin (2) - 3 freq booin (2) - 17 freq ookin (2) - 1 freq ootin (2) - 5 freq ooin (2) - 1 freq bobin (2) - 1 freq robin (2) - 196 freq oo-in (2) - 1 freq orain (3) - 1 freq oesin (3) - 1 freq vouin (3) - 1 freq byn (3) - 2 freq hoyin (3) - 5 freq buyin (3) - 84 freq i'bin (3) - 2 freq doein (3) - 1 freq boolin (3) - 16 freq toyin (3) - 2 freq ubun (3) - 1 freq yoosin (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 - OBN oobin - 2 freq oban - 3 freq |
OOBIN |
| Time to execute Levenshtein function - 0.396975 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.614954 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.069419 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.043114 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.001069 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. |