Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hitmimer (0) - 1 freq himmer (2) - 1 freq simmer (3) - 309 freq himmler (3) - 1 freq haimmer (3) - 30 freq mithier (3) - 1 freq hammer (3) - 44 freq whittiver (3) - 1 freq whitiver (3) - 38 freq kimmer (3) - 6 freq hivvier (3) - 2 freq timmer (3) - 77 freq hemmer (3) - 21 freq hitler (3) - 10 freq vimmer (3) - 3 freq shimmer (3) - 4 freq fittiver (3) - 4 freq hither (3) - 6 freq hiliger (3) - 1 freq timer (3) - 6 freq gimmer (3) - 2 freq haimer (3) - 2 freq limmer (3) - 19 freq immer (3) - 2 freq jimmer (3) - 5 freq |
hitmimer (0) - 1 freq himmer (3) - 1 freq hemmer (4) - 21 freq hammer (4) - 44 freq timmer (4) - 77 freq haimmer (4) - 30 freq hummer (4) - 2 freq gimmer (5) - 2 freq timer (5) - 6 freq stammer (5) - 1 freq immer (5) - 2 freq jimmer (5) - 5 freq hither (5) - 6 freq limmer (5) - 19 freq haimer (5) - 2 freq zimmer (5) - 3 freq intimmer (5) - 1 freq simmer (5) - 309 freq kimmer (5) - 6 freq himmler (5) - 1 freq vimmer (5) - 3 freq shimmer (5) - 4 freq hitler (5) - 10 freq slummer (6) - 3 freq summer (6) - 196 freq |
SoundEx code - H355 hatman - 1 freq hodman - 1 freq haudin-in - 1 freq heidmen - 1 freq hitmimer - 1 freq haudin-on - 1 freq huttonian - 1 freq heidman - 1 freq hidenin - 1 freq hootenanny - 1 freq |
MetaPhone code - HTMMR hitmimer - 1 freq |
HITMIMER |
Time to execute Levenshtein function - 0.249773 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.435119 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.027431 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.043350 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.000859 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. |