| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bummer (0) - 21 freq bummed (1) - 11 freq bummel (1) - 1 freq wummer (1) - 1 freq bumper (1) - 4 freq bummers (1) - 18 freq nummer (1) - 336 freq hummer (1) - 2 freq summer (1) - 202 freq cummer (1) - 6 freq butter (2) - 134 freq bucher (2) - 1 freq summer' (2) - 1 freq jumper (2) - 43 freq wummen (2) - 36 freq busier (2) - 3 freq tummler (2) - 3 freq lumber (2) - 5 freq bunter (2) - 8 freq sumer (2) - 1 freq memmer (2) - 35 freq commer (2) - 1 freq buzzer (2) - 8 freq immer (2) - 2 freq bomber (2) - 3 freq |
bummer (0) - 21 freq bummerie (2) - 1 freq summer (2) - 202 freq cummer (2) - 6 freq nummer (2) - 336 freq hummer (2) - 2 freq bummers (2) - 18 freq bummed (2) - 11 freq bummel (2) - 1 freq wummer (2) - 1 freq bumper (2) - 4 freq hemmer (3) - 21 freq lammer (3) - 2 freq kimmer (3) - 6 freq simmer (3) - 314 freq bummin (3) - 20 freq bammed (3) - 1 freq limmer (3) - 19 freq gemmer (3) - 1 freq nummur (3) - 1 freq suimmer (3) - 1 freq summur (3) - 1 freq zimmer (3) - 3 freq dammer (3) - 1 freq hammer (3) - 44 freq |
SoundEx code - B560 bonnier - 24 freq bummer - 21 freq binner - 2 freq bane-weary - 2 freq banner - 19 freq bainner - 2 freq beamer - 12 freq boomer - 1 freq binary - 4 freq bawmurrie - 1 freq bummerie - 1 freq bynear - 2 freq beemer - 2 freq baunner - 5 freq bmr - 1 freq |
MetaPhone code - BMR bummer - 21 freq beamer - 12 freq boomer - 1 freq bawmurrie - 1 freq bomber - 3 freq bummerie - 1 freq beemer - 2 freq bamber - 2 freq bmr - 1 freq |
BUMMER |
| Time to execute Levenshtein function - 0.186029 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.349129 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.027203 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.037042 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.000909 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. |