| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| offerain (0) - 7 freq offerin (1) - 64 freq offerains (1) - 1 freq offeran (1) - 2 freq offerins (2) - 5 freq offerit (2) - 1 freq offerin' (2) - 2 freq offendin (2) - 13 freq offern (2) - 1 freq oafferin (2) - 1 freq offrin (2) - 1 freq offering (2) - 8 freq affraid (3) - 1 freq awfferin (3) - 1 freq werain (3) - 1 freq offert (3) - 38 freq affeirin (3) - 1 freq efterhin (3) - 11 freq offerings (3) - 3 freq feerin (3) - 1 freq oafferins (3) - 1 freq referin (3) - 1 freq offered (3) - 47 freq affectin (3) - 1 freq offair (3) - 11 freq |
offerain (0) - 7 freq offeran (1) - 2 freq offerin (1) - 64 freq offern (2) - 1 freq offrin (2) - 1 freq oafferin (2) - 1 freq offerains (2) - 1 freq offerin' (3) - 2 freq effeirin (3) - 31 freq offairin (3) - 1 freq offerit (3) - 1 freq offering (3) - 8 freq affeirin (3) - 1 freq offerins (3) - 5 freq offen (4) - 17 freq offerd (4) - 1 freq offers (4) - 59 freq refrain (4) - 13 freq sifferin (4) - 3 freq differin (4) - 6 freq bufferin (4) - 1 freq offin (4) - 20 freq affirmin (4) - 2 freq offer (4) - 169 freq sufferan (4) - 2 freq |
SoundEx code - O165 offerin - 64 freq oafferin - 1 freq offrin - 1 freq offering - 8 freq offerins - 5 freq o'brian's - 1 freq overweaning - 1 freq offern - 1 freq offeran - 2 freq overindulgin - 1 freq offerain - 7 freq offairin - 1 freq offerains - 1 freq offerin' - 2 freq offerings - 3 freq offrands - 1 freq oberon - 1 freq overhung - 1 freq obrans - 1 freq oafferins - 1 freq o'brien - 1 freq overnight - 1 freq overrun - 1 freq overmorrow - 2 freq |
MetaPhone code - OFRN offerin - 64 freq oafferin - 1 freq offrin - 1 freq offern - 1 freq offeran - 2 freq offerain - 7 freq offairin - 1 freq offerin' - 2 freq overrun - 1 freq |
OFFERAIN |
| Time to execute Levenshtein function - 0.197837 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.363217 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.030086 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.039174 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.000865 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. |