| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| benifit (0) - 1 freq benefit (1) - 74 freq benifitit (2) - 1 freq ten-fit (2) - 1 freq benefits (2) - 54 freq beirit (2) - 1 freq bendit (2) - 2 freq be-eft (3) - 1 freq sniffit (3) - 9 freq bendie (3) - 2 freq lenient (3) - 2 freq fendit (3) - 11 freq delitit (3) - 3 freq beilin (3) - 3 freq beiriet (3) - 3 freq beirdit (3) - 1 freq bexit (3) - 1 freq bunnit (3) - 1 freq recitit (3) - 5 freq believt (3) - 1 freq lifit (3) - 2 freq belevit (3) - 1 freq definit (3) - 3 freq braidit (3) - 3 freq ignitit (3) - 1 freq |
benifit (0) - 1 freq benefit (1) - 74 freq benefits (3) - 54 freq bendit (3) - 2 freq benifitit (3) - 1 freq benefeits (4) - 1 freq bereft (4) - 13 freq bannit (4) - 2 freq benefitin (4) - 2 freq bondit (4) - 1 freq banffie (4) - 2 freq burnfit (4) - 10 freq unfit (4) - 1 freq bandit (4) - 7 freq infit (4) - 1 freq barfit (4) - 4 freq benefited (4) - 2 freq bennite (4) - 1 freq benefitit (4) - 1 freq bankit (4) - 1 freq benefice (4) - 1 freq barefit (4) - 12 freq bifot (4) - 1 freq bent (4) - 104 freq benfica (4) - 1 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 |
BENIFIT |
| Time to execute Levenshtein function - 0.177137 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.341688 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.027215 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.037393 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.000801 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. |