| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haleve (0) - 1 freq halve (1) - 1 freq halleve (1) - 2 freq haeve (1) - 5 freq laeve (2) - 37 freq aleeve (2) - 1 freq have (2) - 1251 freq hakeye (2) - 1 freq haled (2) - 1 freq heeve (2) - 1 freq halse (2) - 1 freq salve (2) - 5 freq leve (2) - 2 freq halely (2) - 7 freq walee (2) - 1 freq hallie (2) - 1 freq haley (2) - 1 freq haevy (2) - 2 freq halle (2) - 3 freq haeved (2) - 2 freq beleve (2) - 6 freq valve (2) - 1 freq haev (2) - 15 freq daeve (2) - 1 freq aleive (2) - 1 freq |
haleve (0) - 1 freq halve (1) - 1 freq haeve (2) - 5 freq halleve (2) - 2 freq haev (3) - 15 freq aleive (3) - 1 freq halle (3) - 3 freq halved (3) - 2 freq beleve (3) - 6 freq valve (3) - 1 freq hales (3) - 1 freq halie (3) - 83 freq hlv (3) - 1 freq alyve (3) - 1 freq haevy (3) - 2 freq alive (3) - 160 freq hale (3) - 965 freq halves (3) - 1 freq haled (3) - 1 freq heeve (3) - 1 freq have (3) - 1251 freq aleeve (3) - 1 freq haley (3) - 1 freq salve (3) - 5 freq halse (3) - 1 freq |
SoundEx code - H410 help - 1140 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 - 7 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 |
HALEVE |
| Time to execute Levenshtein function - 0.364717 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.783215 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.091176 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.097334 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.000860 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. |