| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| offin (0) - 20 freq boffin (1) - 2 freq oftin (1) - 1 freq effin (1) - 14 freq offrin (1) - 1 freq offcn (1) - 1 freq offen (1) - 17 freq offie (1) - 2 freq doffin (1) - 2 freq soffin (1) - 1 freq affin (1) - 2 freq offing (1) - 1 freq coffin (1) - 67 freq gowfin (2) - 2 freq oppin (2) - 4 freq scoffin (2) - 4 freq coaffin (2) - 5 freq fuin (2) - 4 freq fain (2) - 44 freq 'fin (2) - 6 freq offer (2) - 177 freq oshin (2) - 1 freq offish (2) - 12 freq bowfin (2) - 28 freq coffen (2) - 2 freq |
offin (0) - 20 freq effin (1) - 14 freq affin (1) - 2 freq offen (1) - 17 freq coffin (2) - 67 freq affen (2) - 118 freq foofin (2) - 1 freq iffen (2) - 4 freq soffin (2) - 1 freq offing (2) - 1 freq offrin (2) - 1 freq doffin (2) - 2 freq boffin (2) - 2 freq offcn (2) - 1 freq oftin (2) - 1 freq offie (2) - 2 freq offt (3) - 1 freq affie (3) - 6 freq bouffin (3) - 1 freq elfin (3) - 5 freq muffin (3) - 16 freq loafin (3) - 1 freq oaftin (3) - 1 freq office (3) - 216 freq geffin (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 - OFN oven - 51 freq offen - 17 freq offin - 20 freq ovine - 1 freq oven' - 1 freq ofen - 2 freq ofÂ’n - 1 freq |
OFFIN |
| Time to execute Levenshtein function - 0.183686 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.317083 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.027597 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.037554 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.001034 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. |