| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| benefit-of (0) - 1 freq benefited (3) - 2 freq benefittit (3) - 2 freq benefits (3) - 55 freq benefitit (3) - 1 freq benefitted (3) - 1 freq benefit (3) - 73 freq benefitin (3) - 2 freq beneficial (4) - 4 freq benifitit (4) - 1 freq benediction (4) - 4 freq benefice (4) - 1 freq benefeits (4) - 1 freq bereft- (4) - 2 freq benifits (4) - 1 freq benifit (4) - 1 freq bonefire (5) - 1 freq bend-o (5) - 1 freq ten-fit (5) - 1 freq repetition (5) - 6 freq beerit (5) - 4 freq veesitor (5) - 21 freq benfica (5) - 1 freq beekit (5) - 2 freq beefie (5) - 1 freq |
benefit-of (0) - 1 freq benefit (5) - 73 freq benefitin (5) - 2 freq benefitit (5) - 1 freq benefitted (5) - 1 freq benefited (5) - 2 freq benefittit (5) - 2 freq benefits (5) - 55 freq bereft- (6) - 2 freq benifit (6) - 1 freq benefeits (6) - 1 freq benifits (6) - 1 freq benifitit (6) - 1 freq bunnet-fou (7) - 1 freq benefice (7) - 1 freq beneficial (7) - 4 freq banefire (8) - 3 freq bentos (8) - 1 freq bendit (8) - 2 freq benefeicial (8) - 1 freq befittin (8) - 2 freq befits (8) - 3 freq bannik-foo (8) - 1 freq barefit (8) - 13 freq banffie (8) - 2 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 - BNFTF benefit-of - 1 freq |
BENEFIT-OF |
| Time to execute Levenshtein function - 0.197919 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.403396 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.028538 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.038722 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.000991 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. |