| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| offend (0) - 12 freq offends (1) - 1 freq offen (1) - 17 freq offerd (1) - 1 freq offcn (2) - 1 freq frend (2) - 1 freq often (2) - 126 freq offendin (2) - 13 freq doffed (2) - 3 freq offern (2) - 1 freq affen (2) - 118 freq oftens (2) - 1 freq offender (2) - 2 freq offin (2) - 20 freq affens (2) - 8 freq forfend (2) - 3 freq offers (2) - 59 freq offence (2) - 35 freq offendit (2) - 10 freq offert (2) - 38 freq offing (2) - 1 freq offess (2) - 1 freq defend (2) - 23 freq offendet (2) - 7 freq offece (2) - 1 freq |
offend (0) - 12 freq offerd (2) - 1 freq offen (2) - 17 freq offends (2) - 1 freq offendet (3) - 7 freq defend (3) - 23 freq offendit (3) - 10 freq fiend (3) - 4 freq offing (3) - 1 freq offense (3) - 1 freq fend (3) - 28 freq offered (3) - 47 freq offended (3) - 29 freq offence (3) - 35 freq iffen (3) - 4 freq affens (3) - 8 freq affen (3) - 118 freq offendin (3) - 13 freq frend (3) - 1 freq offin (3) - 20 freq offender (3) - 2 freq forfend (3) - 3 freq affin (4) - 2 freq found (4) - 220 freq fuffed (4) - 1 freq |
SoundEx code - O153 opened - 283 freq opent - 85 freq opined - 5 freq open-moued - 1 freq open't - 5 freq openit - 4 freq oppint - 2 freq opint - 1 freq open'd - 1 freq offendit - 10 freq offendin - 13 freq offended - 29 freq offend - 12 freq offendet - 7 freq openta - 1 freq offenders - 3 freq oppened - 22 freq openmouthed - 1 freq opennt - 1 freq offhandedly - 1 freq open-moothed - 2 freq offender - 2 freq offends - 1 freq |
MetaPhone code - OFNT offend - 12 freq |
OFFEND |
| Time to execute Levenshtein function - 0.179474 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.328859 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.032805 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.036939 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.000790 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. |