| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bummers (0) - 18 freq bummer (1) - 21 freq summers (1) - 13 freq nummers (1) - 110 freq bummer's (1) - 2 freq memmers (2) - 41 freq bumper's (2) - 1 freq hemmers (2) - 1 freq dumpers (2) - 1 freq summer (2) - 202 freq lumbers (2) - 3 freq timmers (2) - 6 freq slummers (2) - 1 freq hummer (2) - 2 freq rummels (2) - 2 freq buggers (2) - 31 freq numbers (2) - 65 freq gimmers (2) - 5 freq nummert (2) - 4 freq aumers (2) - 4 freq nummer's (2) - 2 freq jumpers (2) - 16 freq buffers (2) - 1 freq budders (2) - 2 freq emmers (2) - 4 freq |
bummers (0) - 18 freq bummer's (2) - 2 freq nummers (2) - 110 freq summers (2) - 13 freq bummer (2) - 21 freq gimmers (3) - 5 freq limmers (3) - 4 freq hammers (3) - 6 freq immers (3) - 2 freq simmers (3) - 16 freq boomers (3) - 1 freq timmers (3) - 6 freq bombers (3) - 7 freq hemmers (3) - 1 freq memmers (3) - 41 freq emmers (3) - 4 freq yammers (3) - 3 freq bummerie (3) - 1 freq bumbees (4) - 1 freq nummer (4) - 336 freq buyers (4) - 6 freq cumers (4) - 1 freq bulders (4) - 1 freq bummed (4) - 11 freq bummelt (4) - 1 freq |
SoundEx code - B562 banners - 15 freq bummers - 18 freq bunroku - 1 freq bonnyrigg - 23 freq bonnyrigg's - 4 freq beaumarchais - 1 freq bummer's - 2 freq boomers - 1 freq bmraqbp - 1 freq benreez - 1 freq bnrwj - 1 freq banhorseracing - 1 freq bonnyriggrose - 26 freq bonnyriggams - 1 freq bonnyriggs - 1 freq |
MetaPhone code - BMRS bummers - 18 freq bombers - 7 freq bomber's - 1 freq bummer's - 2 freq boomers - 1 freq |
BUMMERS |
| Time to execute Levenshtein function - 0.238925 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.382703 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.027790 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.040961 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.000944 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. |