| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hannibal (0) - 1 freq cannibal (1) - 2 freq cannibals (2) - 2 freq handicap (3) - 2 freq annabel (3) - 1 freq hannaa (3) - 1 freq animal (3) - 99 freq haunbag (3) - 9 freq haunil (3) - 1 freq hannit (3) - 20 freq hantil (3) - 10 freq hannie (3) - 3 freq hannile (3) - 1 freq canonical (3) - 1 freq hannel (3) - 1 freq annual (3) - 24 freq handbag (3) - 21 freq hannah (3) - 10 freq hannin (3) - 3 freq hanbag (3) - 1 freq anneal (3) - 2 freq hannies (3) - 3 freq haunnil (3) - 1 freq haandbag (3) - 1 freq ainimal (3) - 1 freq |
hannibal (0) - 1 freq cannibal (2) - 2 freq hannel (4) - 1 freq hannile (4) - 1 freq haunnil (4) - 1 freq cannibals (4) - 2 freq annabel (4) - 1 freq hangblaa (5) - 1 freq haandbag (5) - 1 freq hannies (5) - 3 freq anneal (5) - 2 freq haundbag (5) - 4 freq hunnel (5) - 4 freq hannle (5) - 5 freq hanna (5) - 11 freq hannin (5) - 3 freq hannaa (5) - 1 freq hanbag (5) - 1 freq hannit (5) - 20 freq hannah (5) - 10 freq haunil (5) - 1 freq haunbag (5) - 9 freq hunnul (5) - 4 freq hannie (5) - 3 freq hantil (5) - 10 freq |
SoundEx code - H514 humble - 26 freq humplock - 4 freq hinnie-blobs - 2 freq humbly - 6 freq humblin - 1 freq haemophilus - 1 freq hinnie--blobs - 1 freq haunful - 1 freq haunbell - 1 freq hmflzdn - 1 freq humbled - 1 freq hannaflint - 1 freq hannibal - 1 freq henbell - 2 freq humbling - 1 freq |
MetaPhone code - HNBL haunbell - 1 freq hannibal - 1 freq henbell - 2 freq |
HANNIBAL |
| Time to execute Levenshtein function - 0.206157 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.400500 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.028329 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.037926 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.000804 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. |