| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| heidbummer (0) - 5 freq heid-bummer (1) - 7 freq heidbummery (1) - 7 freq 'heid-bummer' (3) - 1 freq heidbanger (3) - 5 freq midsummer (3) - 4 freq drummer (4) - 11 freq heidsmen (4) - 1 freq heider (4) - 12 freq himmer (4) - 1 freq hummer (4) - 2 freq heidmen (4) - 1 freq heid-banger (4) - 1 freq misummer (4) - 1 freq heid-butted (4) - 1 freq haimmer (4) - 30 freq blaebummer (4) - 1 freq heidbangers (4) - 1 freq midsimmer (4) - 4 freq hemmer (4) - 21 freq bummer (4) - 21 freq heid-gie (5) - 1 freq iansummer (5) - 1 freq verstummen (5) - 1 freq hemmers (5) - 1 freq |
heidbummer (0) - 5 freq heidbummery (1) - 7 freq heid-bummer (2) - 7 freq midsummer (5) - 4 freq heidbanger (5) - 5 freq haimmer (6) - 30 freq midsimmer (6) - 4 freq hemmer (6) - 21 freq bummer (6) - 21 freq hummer (6) - 2 freq blaebummer (6) - 1 freq 'heid-bummer' (6) - 1 freq drummer (6) - 11 freq himmer (6) - 1 freq heidmen (7) - 1 freq dammer (7) - 1 freq hitmimer (7) - 1 freq hammer (7) - 44 freq heidsmen (7) - 1 freq heider (7) - 12 freq misummer (7) - 1 freq heid-banger (7) - 1 freq decemmer (7) - 1 freq heidbangers (7) - 1 freq hummel (8) - 5 freq |
SoundEx code - H315 headphones - 1 freq heidbanger - 5 freq heid-banger - 1 freq heid-bummer - 7 freq heidphones - 13 freq heidphone - 2 freq hat-band - 1 freq heid-bangers - 3 freq heidbummer - 5 freq heidbummery - 7 freq 'heid-bummer' - 1 freq heidbangers - 1 freq heedphones - 1 freq |
MetaPhone code - HTBMR heid-bummer - 7 freq heidbummer - 5 freq heidbummery - 7 freq 'heid-bummer' - 1 freq |
HEIDBUMMER |
| Time to execute Levenshtein function - 0.197326 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.346641 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.033603 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.040089 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.001053 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. |