| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hrvmam (0) - 1 freq prima (3) - 7 freq fram (3) - 1 freq ream (3) - 4 freq gram (3) - 10 freq kucmam (3) - 1 freq hodman (3) - 1 freq fremm (3) - 5 freq rva (3) - 1 freq hevna (3) - 8 freq graham (3) - 38 freq tram (3) - 23 freq huvna (3) - 1 freq truman (3) - 2 freq ormal (3) - 1 freq hoam (3) - 4 freq cream (3) - 139 freq haslam (3) - 1 freq prma (3) - 1 freq hivvan (3) - 10 freq cram (3) - 2 freq huvnae (3) - 61 freq hivna (3) - 48 freq hima (3) - 4 freq rzmpm (3) - 1 freq |
hrvmam (0) - 1 freq hvamm (4) - 1 freq harman (5) - 1 freq haimm (5) - 1 freq hrv (5) - 1 freq hamm (5) - 1 freq grimm (5) - 4 freq rimm (5) - 2 freq trvm (5) - 1 freq hmmm (5) - 7 freq hemm (5) - 12 freq rummm (5) - 1 freq hlmm (5) - 1 freq hmmmm (5) - 4 freq fremm (5) - 5 freq herman (5) - 1 freq hmm (5) - 22 freq nvmm (5) - 1 freq himm (5) - 1 freq premium (6) - 2 freq bream (6) - 2 freq hardmen (6) - 2 freq cromar (6) - 1 freq harvey (6) - 5 freq aromas (6) - 1 freq |
SoundEx code - H615 horfinn - 1 freq hairpins - 1 freq harbinger - 2 freq harpoon - 8 freq harpooner - 5 freq harpoons - 3 freq harbingers - 2 freq hairpin - 3 freq harpooned - 1 freq hairband - 1 freq hrvmam - 1 freq |
MetaPhone code - RFMM hrvmam - 1 freq |
HRVMAM |
| Time to execute Levenshtein function - 0.231430 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.368089 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.030550 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.039519 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.000850 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. |