| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| offen (0) - 17 freq ofen (1) - 2 freq affen (1) - 118 freq offcn (1) - 1 freq offin (1) - 20 freq iffen (1) - 4 freq often (1) - 126 freq offer (1) - 169 freq offend (1) - 12 freq offern (1) - 1 freq coffen (1) - 2 freq affens (2) - 8 freq offies (2) - 1 freq aff'n (2) - 1 freq affin (2) - 2 freq open (2) - 719 freq owsen (2) - 3 freq offess (2) - 1 freq olden (2) - 1 freq offerin (2) - 64 freq ogden (2) - 2 freq oftin (2) - 1 freq toffey (2) - 1 freq offees (2) - 1 freq oftea (2) - 1 freq |
offen (0) - 17 freq iffen (1) - 4 freq offin (1) - 20 freq affen (1) - 118 freq offern (2) - 1 freq affin (2) - 2 freq offend (2) - 12 freq effin (2) - 14 freq coffen (2) - 2 freq ofen (2) - 2 freq offer (2) - 169 freq offcn (2) - 1 freq often (2) - 126 freq offence (3) - 35 freq offs (3) - 9 freq iffer (3) - 1 freq saffen (3) - 1 freq offt (3) - 1 freq aften (3) - 340 freq offense (3) - 1 freq offrin (3) - 1 freq doffin (3) - 2 freq offing (3) - 1 freq offece (3) - 1 freq oaffer (3) - 1 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 - OFN oven - 51 freq offen - 17 freq offin - 20 freq ovine - 1 freq oven' - 1 freq ofen - 2 freq ofÂ’n - 1 freq |
OFFEN |
| Time to execute Levenshtein function - 0.181196 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.326092 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.030190 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.037841 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.000948 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. |