Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
offeran (0) - 2 freq offerain (1) - 7 freq offern (1) - 1 freq offerin (1) - 65 freq oafferin (2) - 1 freq offrin (2) - 1 freq offerin' (2) - 2 freq offert (2) - 42 freq offering (2) - 9 freq offerit (2) - 1 freq sufferan (2) - 2 freq offen (2) - 17 freq offerins (2) - 5 freq orderan (2) - 2 freq offers (2) - 67 freq offer't (2) - 1 freq offer (2) - 177 freq offerains (2) - 1 freq offered (2) - 48 freq offerd (2) - 1 freq fern (3) - 5 freq wonderan (3) - 7 freq affeirin (3) - 1 freq offess (3) - 1 freq hooveran (3) - 1 freq |
offeran (0) - 2 freq offerin (1) - 65 freq offern (1) - 1 freq offerain (1) - 7 freq offrin (2) - 1 freq oafferin (2) - 1 freq offerains (3) - 1 freq offered (3) - 48 freq offer (3) - 177 freq offairin (3) - 1 freq offers (3) - 67 freq effeirin (3) - 31 freq offerd (3) - 1 freq affeirin (3) - 1 freq offerit (3) - 1 freq offert (3) - 42 freq offerin' (3) - 2 freq sufferan (3) - 2 freq offering (3) - 9 freq offerins (3) - 5 freq offen (3) - 17 freq sufferin (4) - 36 freq affhan (4) - 1 freq affen (4) - 118 freq differen (4) - 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 |
OFFERAN |
Time to execute Levenshtein function - 0.220020 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.390123 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.027766 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.037333 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.000932 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. |