| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| offerin (0) - 65 freq offering (1) - 9 freq offerit (1) - 1 freq offerin' (1) - 2 freq offerins (1) - 5 freq offerain (1) - 7 freq offrin (1) - 1 freq offern (1) - 1 freq oafferin (1) - 1 freq offeran (1) - 2 freq referin (2) - 1 freq feerin (2) - 1 freq awfferin (2) - 1 freq offer't (2) - 1 freq offin (2) - 20 freq offered (2) - 48 freq offendin (2) - 13 freq bufferin (2) - 1 freq faerin (2) - 1 freq orderin (2) - 10 freq oafferins (2) - 1 freq differin (2) - 6 freq offerains (2) - 1 freq offen (2) - 17 freq profferin (2) - 1 freq |
offerin (0) - 65 freq offrin (1) - 1 freq offern (1) - 1 freq offerain (1) - 7 freq offeran (1) - 2 freq oafferin (1) - 1 freq effeirin (2) - 31 freq affeirin (2) - 1 freq offairin (2) - 1 freq offering (2) - 9 freq offerins (2) - 5 freq offerin' (2) - 2 freq offerit (2) - 1 freq offert (3) - 42 freq offerd (3) - 1 freq sufferin (3) - 36 freq awfferin (3) - 1 freq offers (3) - 67 freq referin (3) - 1 freq sifferin (3) - 3 freq feerin (3) - 1 freq offen (3) - 17 freq offer (3) - 177 freq faerin (3) - 1 freq offerains (3) - 1 freq |
SoundEx code - O165 offerin - 65 freq oafferin - 1 freq offrin - 1 freq offering - 9 freq offerins - 5 freq o'brian's - 1 freq over-indulge - 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 - 65 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 |
OFFERIN |
| Time to execute Levenshtein function - 0.240902 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.372870 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.028506 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.038366 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.000910 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. |