Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
helluva (0) - 25 freq hellova (1) - 2 freq hellloa (2) - 1 freq helley (3) - 1 freq helja (3) - 1 freq hellery (3) - 3 freq hells (3) - 1 freq heldup (3) - 1 freq hello (3) - 48 freq holla (3) - 1 freq bella (3) - 96 freq heller (3) - 3 freq hellish (3) - 19 freq helly (3) - 16 freq ella (3) - 26 freq hellie (3) - 1 freq fella (3) - 101 freq halleve (3) - 2 freq helium (3) - 8 freq hellomag (3) - 1 freq helga (3) - 1 freq hellay (3) - 1 freq bellum (3) - 3 freq hellyan (3) - 2 freq helli (3) - 2 freq |
helluva (0) - 25 freq hellova (1) - 2 freq halleve (3) - 2 freq hellloa (3) - 1 freq hell (4) - 370 freq hellie (4) - 1 freq helle (4) - 6 freq hellay (4) - 1 freq helli (4) - 2 freq hellyan (4) - 2 freq helley (4) - 1 freq helly (4) - 16 freq heller (4) - 3 freq hells (4) - 1 freq hellery (4) - 3 freq hello (4) - 48 freq hell' (4) - 1 freq holla (4) - 1 freq hollies (5) - 2 freq hollieb (5) - 4 freq hallie (5) - 1 freq hulls (5) - 9 freq hillie (5) - 1 freq hollin (5) - 1 freq hallow (5) - 2 freq |
SoundEx code - H410 help - 1128 freq half - 539 freq half-wey - 1 freq 'help - 19 freq helluva - 25 freq 'half - 2 freq helpfu - 21 freq halleve - 2 freq helf - 2 freq haulf - 4 freq halfway - 6 freq holby - 4 freq halp - 54 freq halfwye - 1 freq half-wye - 1 freq 'helpfae' - 1 freq helpfae - 1 freq halfa - 2 freq 'help' - 1 freq halpfu - 1 freq hlf - 2 freq helpfu' - 2 freq 'half-awa' - 1 freq 'half-awa - 1 freq half-awa - 2 freq €˜help - 2 freq €˜halp - 1 freq hallabie - 1 freq €œhelp - 3 freq hylop - 1 freq h-alba - 2 freq €˜half - 1 freq halve - 1 freq hellova - 2 freq haleve - 1 freq halabi - 1 freq hlv - 1 freq hollieb - 4 freq |
MetaPhone code - HLF half - 539 freq helluva - 25 freq 'half - 2 freq halleve - 2 freq helf - 2 freq haulf - 4 freq halfa - 2 freq €˜half - 1 freq halve - 1 freq hellova - 2 freq haleve - 1 freq |
HELLUVA |
Time to execute Levenshtein function - 0.200354 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.357693 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.027463 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.036444 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.000847 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. |