| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bummerie (0) - 1 freq summarie (2) - 3 freq butterie (2) - 7 freq bummers (2) - 18 freq bummelin (2) - 1 freq bummer's (2) - 2 freq nummerin (2) - 6 freq bummer (2) - 21 freq cummerit (2) - 1 freq submerge (3) - 1 freq summarise (3) - 1 freq semmelie (3) - 8 freq bullerin (3) - 1 freq femmelie (3) - 2 freq bufferin (3) - 1 freq stimmerie (3) - 1 freq tummelin (3) - 1 freq bulderit (3) - 1 freq immerse (3) - 3 freq wummer (3) - 1 freq summodie (3) - 11 freq bummed (3) - 11 freq bummel (3) - 1 freq dummie (3) - 1 freq buttrie (3) - 4 freq |
bummerie (0) - 1 freq bummer (2) - 21 freq summarie (3) - 3 freq bummers (3) - 18 freq wummer (4) - 1 freq summer (4) - 202 freq nummer (4) - 336 freq bummed (4) - 11 freq cummer (4) - 6 freq bummel (4) - 1 freq hummer (4) - 2 freq bumper (4) - 4 freq bummin (4) - 20 freq nummerin (4) - 6 freq bummer's (4) - 2 freq bummelin (4) - 1 freq cummerit (4) - 1 freq butterie (4) - 7 freq immer (5) - 2 freq summerlee (5) - 1 freq bammed (5) - 1 freq gimmer (5) - 2 freq memorie (5) - 13 freq dammerin (5) - 1 freq suimmer (5) - 1 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 |
BUMMERIE |
| Time to execute Levenshtein function - 0.614129 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 - 1.112739 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.177197 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.198361 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.001303 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. |