| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bunches (0) - 6 freq brunches (1) - 2 freq lunches (1) - 7 freq benches (1) - 13 freq buncher (1) - 1 freq bunched (1) - 1 freq punches (1) - 5 freq dunches (1) - 1 freq buchts (2) - 6 freq wenches (2) - 2 freq bungles (2) - 1 freq bunchrew (2) - 1 freq funcies (2) - 5 freq munched (2) - 3 freq butchers (2) - 12 freq benche (2) - 1 freq bunchy (2) - 1 freq hunched (2) - 6 freq bunchry (2) - 1 freq bushes (2) - 41 freq auncles (2) - 1 freq ounces (2) - 1 freq hutches (2) - 1 freq dunchers (2) - 1 freq bucher (2) - 1 freq |
bunches (0) - 6 freq benches (1) - 13 freq punches (2) - 5 freq bunched (2) - 1 freq dunches (2) - 1 freq buncher (2) - 1 freq lunches (2) - 7 freq brunches (2) - 2 freq launches (3) - 3 freq munchies (3) - 2 freq bunchin (3) - 1 freq belches (3) - 1 freq braunches (3) - 1 freq bitches (3) - 6 freq branches (3) - 51 freq benched (3) - 1 freq bounces (3) - 4 freq pinches (3) - 2 freq beaches (3) - 11 freq brenches (3) - 10 freq buncha (3) - 2 freq kinches (3) - 8 freq inches (3) - 97 freq finches (3) - 1 freq lenches (3) - 1 freq |
SoundEx code - B522 banshee's - 2 freq benshees - 2 freq bunches - 6 freq benches - 13 freq bounces - 4 freq banshees - 6 freq benkis - 1 freq banjos - 2 freq binges - 1 freq 'banshees' - 1 freq bingos - 1 freq boonces - 4 freq 'boonce's - 1 freq boonce's - 3 freq boneshaker - 1 freq bunghsie - 2 freq banghs - 1 freq bonxie's - 1 freq bangkok - 2 freq bianco's - 1 freq benjy's - 1 freq bonsais - 1 freq bonxies - 4 freq boom-cognate-boom-hum-end-o-game - 1 freq bnqyikqq - 1 freq |
MetaPhone code - BNXS banshee's - 2 freq benshees - 2 freq bunches - 6 freq benches - 13 freq banshees - 6 freq 'banshees' - 1 freq |
BUNCHES |
| Time to execute Levenshtein function - 0.219478 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.401489 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.029143 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.039532 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.000853 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. |