| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| benefitted (0) - 1 freq benefited (1) - 2 freq benefittit (2) - 2 freq befitted (2) - 1 freq benefit (3) - 73 freq benefit-of (3) - 1 freq benefice (3) - 1 freq benefits (3) - 55 freq benefitit (3) - 1 freq benefitin (3) - 2 freq bare-fitted (3) - 1 freq banefire (4) - 3 freq be-etter (4) - 2 freq beneficial (4) - 4 freq generated (4) - 2 freq beheided (4) - 7 freq banefed (4) - 2 freq benefeits (4) - 1 freq behatted (4) - 1 freq besotted (4) - 3 freq beeried (4) - 14 freq misfitted (4) - 5 freq ill-fitted (4) - 1 freq beleted (4) - 1 freq permitted (4) - 5 freq |
benefitted (0) - 1 freq benefited (2) - 2 freq befitted (3) - 1 freq benefittit (3) - 2 freq benefitit (4) - 1 freq benefit-of (5) - 1 freq benifitit (5) - 1 freq benefit (5) - 73 freq benefitin (5) - 2 freq bare-fitted (5) - 1 freq benefits (5) - 55 freq besotted (6) - 3 freq behatted (6) - 1 freq misfitted (6) - 5 freq fitted (6) - 27 freq benifit (6) - 1 freq benefeits (6) - 1 freq benifits (6) - 1 freq befittin (6) - 2 freq banefed (6) - 2 freq knitted (6) - 13 freq benefice (6) - 1 freq benighted (6) - 1 freq bonefire (7) - 1 freq banditti (7) - 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 - BNFTT benefitit - 1 freq benefittit - 2 freq benefited - 2 freq benighted - 1 freq benifitit - 1 freq benefitted - 1 freq |
BENEFITTED |
| Time to execute Levenshtein function - 0.200923 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.355605 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.027928 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.037003 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.000856 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. |