| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hkhmofknc (0) - 1 freq hummocked (5) - 1 freq dehmond (5) - 1 freq hofn (5) - 4 freq kcmanc (5) - 1 freq okrmock (5) - 1 freq hermon (5) - 1 freq hormone (5) - 4 freq hmvfmn (5) - 1 freq hammock (5) - 4 freq hoofing (5) - 8 freq thmkn (5) - 1 freq phknc (5) - 1 freq hummocks (5) - 1 freq hummocky (5) - 1 freq skoofin (5) - 1 freq harmony (5) - 15 freq kemonn (5) - 1 freq hkhjaf (5) - 1 freq movin (6) - 130 freq mond (6) - 4 freq howfin (6) - 5 freq moarn' (6) - 1 freq scoofin' (6) - 2 freq moek (6) - 1 freq |
hkhmofknc (0) - 1 freq phknc (9) - 1 freq thmkn (9) - 1 freq hkhjaf (9) - 1 freq kcmanc (9) - 1 freq ukhomeoffice (9) - 1 freq kemonn (10) - 1 freq harmony (10) - 15 freq humankin (10) - 2 freq hkzfeosn (10) - 1 freq harmonica (10) - 5 freq skoofin (10) - 1 freq hegemonic (10) - 3 freq hkvymn (10) - 1 freq humankind (10) - 5 freq hermon (10) - 1 freq hummocky (10) - 1 freq okrmock (10) - 1 freq hofn (10) - 4 freq hummocked (10) - 1 freq dehmond (10) - 1 freq hmvfmn (10) - 1 freq hormone (10) - 4 freq hoofing (10) - 8 freq hummocks (10) - 1 freq |
SoundEx code - H251 hoosomivver - 2 freq housumever - 1 freq housomiver - 1 freq hoosumever - 16 freq hoosumivir - 1 freq hackum-plackum - 1 freq hoosumivver - 17 freq hoosumiver - 2 freq housimiver - 1 freq housomever - 5 freq hoosomiver - 1 freq housummivver - 1 freq howsumever - 1 freq hoosomever - 1 freq hkhmofknc - 1 freq hqmpoyxevq - 1 freq hogganfield - 1 freq hznpoguuwa - 1 freq hginvzuo - 1 freq |
MetaPhone code - KMFKNK hkhmofknc - 1 freq |
HKHMOFKNC |
| Time to execute Levenshtein function - 0.226167 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.397204 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.031216 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.041656 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.000936 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. |