| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| offerins (0) - 5 freq offerings (1) - 3 freq offerains (1) - 1 freq oafferins (1) - 1 freq offerin' (1) - 2 freq offering (1) - 9 freq offerin (1) - 65 freq feerins (2) - 1 freq offerit (2) - 1 freq offerain (2) - 7 freq offrin (2) - 1 freq oafferin (2) - 1 freq offers (2) - 67 freq owerins (2) - 1 freq offeran (2) - 2 freq offern (2) - 1 freq efterins (2) - 1 freq efterhins (3) - 9 freq eftirins (3) - 3 freq ordering (3) - 3 freq offies (3) - 1 freq eerins (3) - 6 freq offert (3) - 42 freq offen (3) - 17 freq sifferin (3) - 3 freq |
offerins (0) - 5 freq oafferins (1) - 1 freq offerains (1) - 1 freq offerin (2) - 65 freq offering (2) - 9 freq offerin' (2) - 2 freq offerings (2) - 3 freq offers (3) - 67 freq offeran (3) - 2 freq offern (3) - 1 freq oafferin (3) - 1 freq efterins (3) - 1 freq offrin (3) - 1 freq feerins (3) - 1 freq offerain (3) - 7 freq offrands (4) - 1 freq fairins (4) - 7 freq effeirs (4) - 13 freq affens (4) - 8 freq farins (4) - 1 freq offense (4) - 1 freq offairin (4) - 1 freq forerins (4) - 1 freq oaffers (4) - 1 freq affeirin (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 - OFRNS offerins - 5 freq offerains - 1 freq oafferins - 1 freq |
OFFERINS |
| Time to execute Levenshtein function - 0.275018 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.647683 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.036934 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.075315 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.005195 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. |