| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oafferin (0) - 1 freq offerin (1) - 65 freq oafferins (1) - 1 freq offern (2) - 1 freq offerain (2) - 7 freq affeirin (2) - 1 freq offerit (2) - 1 freq offrin (2) - 1 freq oarderin (2) - 3 freq dafferie (2) - 4 freq offerins (2) - 5 freq bufferin (2) - 1 freq sifferin (2) - 3 freq offerin' (2) - 2 freq offering (2) - 9 freq offeran (2) - 2 freq awfferin (2) - 1 freq oaffer (2) - 2 freq sufferin (2) - 36 freq oaffers (2) - 1 freq differin (2) - 6 freq flafferin (2) - 3 freq differiny (3) - 1 freq offerd (3) - 1 freq gaaderin (3) - 1 freq |
oafferin (0) - 1 freq offerin (1) - 65 freq offrin (2) - 1 freq offeran (2) - 2 freq affeirin (2) - 1 freq oafferins (2) - 1 freq offern (2) - 1 freq offerain (2) - 7 freq sufferin (3) - 36 freq awfferin (3) - 1 freq oaffers (3) - 1 freq offairin (3) - 1 freq effeirin (3) - 31 freq differin (3) - 6 freq oaffer (3) - 2 freq offerins (3) - 5 freq offerit (3) - 1 freq offering (3) - 9 freq bufferin (3) - 1 freq sifferin (3) - 3 freq offerin' (3) - 2 freq deifferin (4) - 1 freq faffin (4) - 1 freq affen (4) - 118 freq offin (4) - 20 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 |
OAFFERIN |
| Time to execute Levenshtein function - 0.233386 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.401632 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.028900 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.038571 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.001179 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. |