| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bumped (0) - 23 freq dumped (1) - 26 freq pumped (1) - 15 freq jumped (1) - 68 freq lumped (1) - 2 freq bumed (1) - 1 freq mumped (1) - 1 freq bummed (1) - 11 freq bumper (1) - 4 freq humped (1) - 2 freq burped (1) - 2 freq bunged (2) - 7 freq limped (2) - 1 freq blumed (2) - 4 freq budged (2) - 1 freq bump's (2) - 1 freq buzzed (2) - 1 freq bammed (2) - 1 freq buited (2) - 1 freq pulped (2) - 1 freq jumpe (2) - 1 freq bumpin (2) - 9 freq romped (2) - 1 freq tumed (2) - 1 freq jumed (2) - 1 freq |
bumped (0) - 23 freq bummed (2) - 11 freq humped (2) - 2 freq burped (2) - 2 freq mumped (2) - 1 freq bumper (2) - 4 freq pumped (2) - 15 freq bumed (2) - 1 freq jumped (2) - 68 freq dumped (2) - 26 freq lumped (2) - 2 freq ramped (3) - 3 freq lamped (3) - 2 freq bumpit (3) - 4 freq beeped (3) - 1 freq camped (3) - 5 freq bump (3) - 23 freq bumph (3) - 3 freq bumps (3) - 9 freq bopped (3) - 1 freq tamped (3) - 1 freq jimped (3) - 6 freq bumpy (3) - 1 freq bombed (3) - 7 freq dumpid (3) - 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 - BMPT bumped - 23 freq bampot - 30 freq bumpit - 4 freq bampÔt - 1 freq bampôt' - 1 freq bampôt - 3 freq |
BUMPED |
| Time to execute Levenshtein function - 0.221133 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.337234 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.027711 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.037160 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.000901 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. |