| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hillman (0) - 3 freq hill-man (1) - 1 freq hillmen (1) - 1 freq holl-an (2) - 1 freq milkman (2) - 4 freq hallan (2) - 1 freq willan (2) - 5 freq hilltap (2) - 1 freq fillan (2) - 8 freq oilman (2) - 1 freq dillan (2) - 1 freq gillian (2) - 7 freq gillan (2) - 5 freq millan (2) - 1 freq hill-men (2) - 7 freq shillan (2) - 1 freq collman (2) - 1 freq lillian (2) - 1 freq hellyan (2) - 2 freq hielan (2) - 27 freq killan (2) - 2 freq tiltan (3) - 1 freq hill-tap (3) - 2 freq tillin (3) - 3 freq diallan (3) - 1 freq |
hillman (0) - 3 freq hillmen (1) - 1 freq hill-man (2) - 1 freq hellyan (3) - 2 freq hill-men (3) - 7 freq collman (3) - 1 freq hallan (3) - 1 freq holl-an (3) - 1 freq hielanman (4) - 3 freq hielan (4) - 27 freq hillroun (4) - 1 freq killan (4) - 2 freq hollin (4) - 1 freq hilltoon (4) - 1 freq killymain (4) - 1 freq hallon (4) - 1 freq hallion (4) - 16 freq hellomag (4) - 1 freq hilltoun (4) - 7 freq fillan (4) - 8 freq oilman (4) - 1 freq lillian (4) - 1 freq willan (4) - 5 freq hilltap (4) - 1 freq dillan (4) - 1 freq |
SoundEx code - H455 hielanman - 3 freq hielanmen - 2 freq hill-men - 7 freq hill-man - 1 freq hillmen - 1 freq hillman - 3 freq heilanmen - 1 freq h-eileanan - 1 freq hwylmwnu - 1 freq helenmoncrieff - 32 freq helenmoncrieff- - 1 freq |
MetaPhone code - HLMN hill-men - 7 freq hill-man - 1 freq hillmen - 1 freq hillman - 3 freq |
HILLMAN |
| Time to execute Levenshtein function - 0.236891 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.428362 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.027515 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.039781 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.000961 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. |