Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
oaffer (0) - 1 freq waffer (1) - 1 freq offer (1) - 169 freq oaffir (1) - 5 freq gaffer (1) - 35 freq oaffur (1) - 1 freq oaffers (1) - 1 freq affen (2) - 118 freq gaffed (2) - 13 freq waffed (2) - 4 freq seffer (2) - 1 freq offen (2) - 17 freq baffel (2) - 1 freq oaffy (2) - 3 freq oarder (2) - 5 freq affere (2) - 1 freq loafer (2) - 1 freq niffer (2) - 7 freq offerd (2) - 1 freq puffer (2) - 1 freq affeir (2) - 1 freq oafficer (2) - 2 freq coaffe (2) - 1 freq offers (2) - 59 freq saffen (2) - 1 freq |
oaffer (0) - 1 freq oaffir (1) - 5 freq oaffur (1) - 1 freq offer (1) - 169 freq affeir (2) - 1 freq affere (2) - 1 freq oaffers (2) - 1 freq gaffer (2) - 35 freq iffer (2) - 1 freq waffer (2) - 1 freq effeir (3) - 1 freq differ (3) - 135 freq heffer (3) - 2 freq duffer (3) - 6 freq afer (3) - 1 freq oaffae (3) - 2 freq safer (3) - 18 freq wafer (3) - 2 freq suffer (3) - 57 freq offern (3) - 1 freq siffer (3) - 3 freq iffery (3) - 1 freq oafferin (3) - 1 freq affair (3) - 36 freq offert (3) - 38 freq |
SoundEx code - O160 over - 335 freq offer - 169 freq oaffer - 1 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 - 335 freq offer - 169 freq oaffer - 1 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.187519 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.348695 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.028811 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.036696 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.000837 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. |