| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bunchrew (0) - 1 freq bunched (2) - 1 freq buncher (2) - 1 freq bunchry (2) - 1 freq bunches (2) - 6 freq butched (3) - 2 freq unscrew (3) - 3 freq bunchy (3) - 1 freq lunches (3) - 7 freq dunched (3) - 8 freq munched (3) - 3 freq duncher (3) - 4 freq punches (3) - 5 freq benches (3) - 13 freq wuncher (3) - 1 freq bucher (3) - 1 freq butchered (3) - 4 freq bunch (3) - 105 freq punched (3) - 19 freq butcher (3) - 36 freq hunched (3) - 6 freq brunches (3) - 2 freq bunchin (3) - 1 freq munchies (3) - 2 freq benche (3) - 1 freq |
bunchrew (0) - 1 freq buncher (3) - 1 freq bunchry (3) - 1 freq bunches (4) - 6 freq bunched (4) - 1 freq butcher (5) - 36 freq bunch (5) - 105 freq butchered (5) - 4 freq bunchin (5) - 1 freq banchory (5) - 6 freq bucher (5) - 1 freq benched (5) - 1 freq buncha (5) - 2 freq benche (5) - 1 freq beshrew (5) - 1 freq duncher (5) - 4 freq bunchy (5) - 1 freq wuncher (5) - 1 freq benches (5) - 13 freq bouncer (6) - 22 freq blueochre (6) - 1 freq brochire (6) - 1 freq butchery (6) - 2 freq butchers (6) - 12 freq munchers (6) - 3 freq |
SoundEx code - B526 bouncer - 22 freq bouncers - 5 freq bouncer's - 2 freq bangor - 9 freq bancouris - 1 freq bunker - 22 freq 'banks're - 1 freq banker - 12 freq bonkers - 5 freq bunkery - 2 freq baungarrif - 1 freq bunkers - 12 freq 'bankrupt' - 1 freq bankers - 4 freq banchory - 6 freq bonjoor - 2 freq bankrupt - 8 freq banger - 5 freq bangers - 3 freq bin-cairt - 1 freq banesair - 1 freq ben-gurion - 1 freq buncher - 1 freq booncers - 2 freq bunchrew - 1 freq bangordub - 1 freq bomscare - 1 freq bin-hoker's - 1 freq bunchry - 1 freq bonaccordcentre - 3 freq bunker' - 1 freq banjorennie - 1 freq bankruptit - 1 freq |
MetaPhone code - BNXR banchory - 6 freq buncher - 1 freq bunchrew - 1 freq bunchry - 1 freq |
BUNCHREW |
| Time to execute Levenshtein function - 0.217608 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.409260 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.028367 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.037279 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.000890 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. |