| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| benefit (0) - 74 freq benifit (1) - 1 freq benefits (1) - 54 freq benefitin (2) - 2 freq beekit (2) - 2 freq beerit (2) - 4 freq bereft (2) - 13 freq barefit (2) - 12 freq bendit (2) - 2 freq ten-fit (2) - 1 freq belevit (2) - 1 freq beefie (2) - 1 freq benefited (2) - 2 freq bekeit (2) - 1 freq benefice (2) - 1 freq be-eft (2) - 1 freq benefitit (2) - 1 freq benedict (2) - 5 freq benefeits (2) - 1 freq banffie (3) - 2 freq beenie (3) - 5 freq unfit (3) - 1 freq beelin (3) - 22 freq beret (3) - 3 freq jeegit (3) - 1 freq |
benefit (0) - 74 freq benifit (1) - 1 freq benefits (2) - 54 freq benefice (3) - 1 freq benefited (3) - 2 freq benefitit (3) - 1 freq benefeits (3) - 1 freq be-eft (3) - 1 freq bendit (3) - 2 freq benefitin (3) - 2 freq bereft (3) - 13 freq barefit (3) - 12 freq bennite (4) - 1 freq barefuit (4) - 10 freq benfica (4) - 1 freq benifitit (4) - 1 freq infit (4) - 1 freq burnfit (4) - 10 freq bent (4) - 104 freq bannit (4) - 2 freq bunnit (4) - 1 freq banefire (4) - 3 freq bonefire (4) - 1 freq bondit (4) - 1 freq banffie (4) - 2 freq |
SoundEx code - B513 bumped - 23 freq bombed - 7 freq benefit - 74 freq bampots'll - 1 freq bampot - 30 freq benifit - 1 freq bampot's - 1 freq bumpit - 4 freq bampÔt - 1 freq bampôt' - 1 freq bampôt - 3 freq bampôtisserie - 1 freq benefits - 54 freq benefitit - 1 freq benefeits - 1 freq bampots - 8 freq banefed - 2 freq benefittit - 2 freq benefited - 2 freq 'bampots' - 1 freq benefitin - 2 freq benifitit - 1 freq benefitted - 1 freq |
MetaPhone code - BNFT benefit - 74 freq benifit - 1 freq banefed - 2 freq |
BENEFIT |
| Time to execute Levenshtein function - 0.246732 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.596630 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.028709 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.077622 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.000872 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. |