| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oaffer (0) - 2 freq oaffers (1) - 1 freq gaffer (1) - 35 freq waffer (1) - 1 freq affer (1) - 2 freq oaffur (1) - 1 freq offer (1) - 177 freq oaffir (1) - 5 freq offen (2) - 17 freq afer (2) - 1 freq coaffe (2) - 1 freq caffee (2) - 2 freq puffer (2) - 1 freq oaffirt (2) - 2 freq buffer (2) - 2 freq oafferin (2) - 1 freq caffe (2) - 1 freq gaffe (2) - 1 freq safter (2) - 10 freq affen (2) - 118 freq rafter (2) - 1 freq oaften (2) - 6 freq saufer (2) - 2 freq spaffer (2) - 1 freq wafer (2) - 2 freq |
oaffer (0) - 2 freq affer (1) - 2 freq oaffir (1) - 5 freq oaffur (1) - 1 freq offer (1) - 177 freq affere (2) - 1 freq iffer (2) - 1 freq affeir (2) - 1 freq gaffer (2) - 35 freq oaffers (2) - 1 freq waffer (2) - 1 freq affair (3) - 36 freq seffer (3) - 1 freq oaff (3) - 110 freq niffer (3) - 7 freq offert (3) - 42 freq iffery (3) - 1 freq kaffir (3) - 2 freq oaffae (3) - 2 freq duffer (3) - 6 freq suffer (3) - 58 freq offers (3) - 67 freq effeir (3) - 1 freq saifer (3) - 3 freq fifer (3) - 11 freq |
SoundEx code - O160 over - 340 freq offer - 177 freq oaffer - 2 freq o'fare - 1 freq opera - 11 freq oaffir - 5 freq opera' - 1 freq oppor - 1 freq offair - 11 freq oeuvre - 1 freq overaw - 3 freq operae - 1 freq owver - 1 freq oafur - 1 freq oaffur - 1 freq ovr - 1 freq oooveer - 1 freq oboarw - 1 freq |
MetaPhone code - OFR over - 340 freq offer - 177 freq oaffer - 2 freq o'fare - 1 freq oaffir - 5 freq offair - 11 freq oeuvre - 1 freq overaw - 3 freq owver - 1 freq oafur - 1 freq oaffur - 1 freq ovr - 1 freq oooveer - 1 freq |
OAFFER |
| Time to execute Levenshtein function - 0.326861 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.670198 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.030611 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.039785 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.000902 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. |