| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| benifits (0) - 1 freq benefits (1) - 55 freq benifit (1) - 1 freq benefit (2) - 73 freq befits (2) - 3 freq benefeits (2) - 1 freq benifitit (2) - 1 freq benefited (3) - 2 freq eijits (3) - 1 freq bents (3) - 10 freq beirit (3) - 1 freq bandits (3) - 5 freq veisits (3) - 8 freq benefitit (3) - 1 freq seimits (3) - 1 freq endoits (3) - 1 freq beirins (3) - 1 freq bennite (3) - 1 freq benefice (3) - 1 freq benfica (3) - 1 freq bendit (3) - 2 freq benefitin (3) - 2 freq elicits (3) - 1 freq beists (3) - 2 freq meinits (3) - 12 freq |
benifits (0) - 1 freq benefits (1) - 55 freq benifit (2) - 1 freq benefeits (2) - 1 freq benifitit (3) - 1 freq befits (3) - 3 freq benefit (3) - 73 freq bandits (4) - 5 freq benefitit (4) - 1 freq benefitin (4) - 2 freq benefited (4) - 2 freq bents (4) - 10 freq benkis (5) - 1 freq bunts (5) - 1 freq beists (5) - 2 freq meinits (5) - 12 freq banquets (5) - 1 freq banties (5) - 1 freq bants (5) - 5 freq bunnets (5) - 9 freq bonfires (5) - 8 freq bentos (5) - 1 freq bennite (5) - 1 freq endoits (5) - 1 freq benefice (5) - 1 freq |
SoundEx code - B513 bumped - 23 freq bombed - 7 freq benefit - 73 freq bampots'll - 1 freq bampot - 30 freq benifit - 1 freq benefit-of - 1 freq benifits - 1 freq benefits - 55 freq bampot's - 1 freq bumpit - 4 freq bampÔt - 1 freq bampôt' - 1 freq bampôt - 3 freq bampôtisserie - 1 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 - BNFTS benifits - 1 freq benefits - 55 freq benefeits - 1 freq |
BENIFITS |
| Time to execute Levenshtein function - 0.648916 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 - 1.098812 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.152370 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.106627 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.000968 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. |