Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
half-hoopin (0) - 2 freq halfhoopin (1) - 1 freq hauf-hopin (2) - 2 freq half-cousin (3) - 1 freq half-moon (3) - 1 freq half-hoidit (3) - 1 freq half-open (3) - 1 freq half-blin (4) - 1 freq half-dozen (4) - 1 freq half-grown (4) - 4 freq hauf-howped (4) - 1 freq half-hid (4) - 1 freq half-rotten (4) - 1 freq half-frozen (4) - 1 freq hallooin (4) - 2 freq hauf-happit (4) - 2 freq halfmoon (4) - 1 freq half-shapit (4) - 1 freq hauf-smoorin (4) - 1 freq half-hidden (4) - 1 freq half-pint (4) - 1 freq hameschoolin (5) - 1 freq half-wit (5) - 1 freq hauf-hour (5) - 3 freq hauf-croon (5) - 1 freq |
half-hoopin (0) - 2 freq halfhoopin (2) - 1 freq hauf-hopin (3) - 2 freq half-open (4) - 1 freq half-hoidit (5) - 1 freq half-cousin (5) - 1 freq half-moon (5) - 1 freq half-shapit (6) - 1 freq half-pint (6) - 1 freq half-hid (6) - 1 freq half-hidden (6) - 1 freq half-dozen (6) - 1 freq half-blin (6) - 1 freq half-tirn (7) - 1 freq half-eaten (7) - 2 freq half-hard (7) - 2 freq hauf-apen (7) - 2 freq half-empty (7) - 1 freq half-done (7) - 1 freq hauf-human (7) - 1 freq hauf-happit (7) - 2 freq halfmoon (7) - 1 freq half-rotten (7) - 1 freq half-frozen (7) - 1 freq half-grown (7) - 4 freq |
SoundEx code - H411 half-open - 1 freq half-hoopin - 2 freq halfhoopin - 1 freq |
MetaPhone code - HLFHPN half-hoopin - 2 freq halfhoopin - 1 freq |
HALF-HOOPIN |
Time to execute Levenshtein function - 0.304128 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.565557 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.027964 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.072681 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.000897 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. |