Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
halesome (0) - 9 freq hailsome (2) - 3 freq handsome (2) - 39 freq wholesome (2) - 1 freq 'awesome (2) - 1 freq hansome (2) - 3 freq dulesome (2) - 18 freq awesome (2) - 35 freq aesome (2) - 6 freq waesome (2) - 19 freq lanesome (2) - 28 freq haunsome (2) - 2 freq hertsome (3) - 9 freq treesome (3) - 1 freq haesnae (3) - 16 freq haundsome (3) - 1 freq lonesome (3) - 9 freq loesome (3) - 7 freq tiresome (3) - 6 freq wullsome (3) - 1 freq leesome (3) - 9 freq wulsome (3) - 2 freq haleve (3) - 1 freq fleysome (3) - 6 freq leasome (3) - 1 freq |
halesome (0) - 9 freq hailsome (2) - 3 freq dulesome (3) - 18 freq haunsome (3) - 2 freq hansome (3) - 3 freq wholesome (3) - 1 freq hailsum (4) - 2 freq wulsome (4) - 2 freq leesome (4) - 9 freq fleysome (4) - 6 freq fulsome (4) - 1 freq luesome (4) - 2 freq loesome (4) - 7 freq hales (4) - 1 freq leasome (4) - 1 freq wilsome (4) - 1 freq aesome (4) - 6 freq awesome (4) - 35 freq 'awesome (4) - 1 freq handsome (4) - 39 freq waesome (4) - 19 freq lanesome (4) - 28 freq hansom (4) - 3 freq halse (4) - 1 freq lowesome (5) - 1 freq |
SoundEx code - H425 halesome - 9 freq hailsome - 3 freq hallucinauons - 1 freq hallucinatin - 2 freq hailsum - 2 freq hallucination - 2 freq hallucinate - 1 freq hailsin - 2 freq halcyon - 2 freq hell's-handsel - 1 freq hooligans - 3 freq hallucinatory - 1 freq helicon - 1 freq haillsum - 1 freq hailzin - 1 freq hooligan - 1 freq |
MetaPhone code - HLSM halesome - 9 freq hailsome - 3 freq hailsum - 2 freq haillsum - 1 freq |
HALESOME |
Time to execute Levenshtein function - 0.190162 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.338631 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.026929 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.036691 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.000834 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. |