| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| benches (0) - 13 freq beeches (1) - 1 freq benched (1) - 1 freq benche (1) - 1 freq lenches (1) - 1 freq beaches (1) - 12 freq bunches (1) - 7 freq brenches (1) - 10 freq wenches (1) - 2 freq belches (1) - 1 freq punches (2) - 5 freq leaches (2) - 3 freq wrenches (2) - 2 freq clenches (2) - 1 freq blenched (2) - 2 freq kinches (2) - 8 freq bench (2) - 58 freq benshees (2) - 2 freq leeches (2) - 4 freq bitches (2) - 6 freq trenches (2) - 11 freq menchies (2) - 1 freq peaches (2) - 2 freq beuchs (2) - 4 freq bunched (2) - 1 freq |
benches (0) - 13 freq bunches (1) - 7 freq wenches (2) - 2 freq belches (2) - 1 freq beaches (2) - 12 freq brenches (2) - 10 freq lenches (2) - 1 freq beeches (2) - 1 freq benched (2) - 1 freq benche (2) - 1 freq inches (3) - 98 freq brunches (3) - 2 freq branches (3) - 52 freq breeches (3) - 1 freq breaches (3) - 3 freq lunches (3) - 7 freq beuchs (3) - 4 freq buncher (3) - 1 freq pinches (3) - 2 freq finches (3) - 1 freq dunches (3) - 1 freq bunched (3) - 1 freq bench (3) - 58 freq kinches (3) - 8 freq bitches (3) - 6 freq |
SoundEx code - B522 banshee's - 2 freq benshees - 2 freq bunches - 7 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 - 7 freq benches - 13 freq banshees - 6 freq 'banshees' - 1 freq |
BENCHES |
| Time to execute Levenshtein function - 0.208502 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.361556 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.027766 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.039159 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.000926 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. |