| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hunnle (0) - 2 freq hunnles (1) - 1 freq hannle (1) - 5 freq haunnle (1) - 7 freq cunnle (1) - 3 freq bunnle (1) - 8 freq hustle (2) - 1 freq munnie (2) - 1 freq hushle (2) - 1 freq hudnae (2) - 62 freq hanle (2) - 4 freq hunnys (2) - 1 freq bundle (2) - 18 freq hunnels (2) - 2 freq hinnie (2) - 24 freq hantle (2) - 116 freq wunnae (2) - 13 freq hunnder (2) - 1 freq hennae (2) - 1 freq hauntle (2) - 2 freq kinnle (2) - 3 freq huvnae (2) - 61 freq hubble (2) - 3 freq caunnle (2) - 1 freq haundle (2) - 9 freq |
hunnle (0) - 2 freq hannle (1) - 5 freq haunnle (1) - 7 freq hunnel (2) - 4 freq hannile (2) - 1 freq hunnles (2) - 1 freq bunnle (2) - 8 freq cunnle (2) - 3 freq hunnul (2) - 4 freq hamnle (3) - 1 freq dinnle (3) - 2 freq hunner (3) - 442 freq haundle (3) - 9 freq sinnle (3) - 1 freq kennle (3) - 2 freq hunni (3) - 5 freq haunle (3) - 26 freq haunnil (3) - 1 freq hankle (3) - 1 freq caunnle (3) - 1 freq hannled (3) - 2 freq hannles (3) - 5 freq hunnies (3) - 1 freq hauntle (3) - 2 freq hunnys (3) - 1 freq |
SoundEx code - H540 hamelie - 2 freq hamely - 45 freq hummle - 12 freq haunle - 26 freq hunnul - 4 freq hunnel - 4 freq hunnle - 2 freq hannel - 1 freq hannile - 1 freq hannle - 5 freq hummel - 5 freq homely - 2 freq hæmlie - 1 freq hanle - 4 freq hamnle - 1 freq hummil - 2 freq henley - 1 freq haunil - 1 freq hamley - 1 freq haunnil - 1 freq haunnle - 7 freq hummly - 1 freq haunel - 3 freq haemly - 1 freq hamil - 2 freq humilie - 1 freq hanlo - 1 freq |
MetaPhone code - HNL haunle - 26 freq hunnul - 4 freq hunnel - 4 freq hunnle - 2 freq hannel - 1 freq hannile - 1 freq hannle - 5 freq hanle - 4 freq henley - 1 freq haunil - 1 freq haunnil - 1 freq haunnle - 7 freq haunel - 3 freq hanlo - 1 freq |
HUNNLE |
| Time to execute Levenshtein function - 0.235036 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.489221 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.028958 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.085713 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.001204 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. |