| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hell-hole (0) - 1 freq hellhole (1) - 2 freq bolt-hole (3) - 1 freq hell-fire (3) - 1 freq helliehowe (3) - 1 freq hellebore (3) - 1 freq kelloholm (3) - 2 freq hert-holl (3) - 5 freq tell-tale (3) - 2 freq het-hoose (4) - 1 freq self-help (4) - 3 freq hale-sale (4) - 1 freq half-mile (4) - 1 freq well-heeled (4) - 1 freq erse-hole (4) - 1 freq rat-hole (4) - 3 freq hertholl (4) - 2 freq mous-hole (4) - 1 freq hen-hoose (4) - 13 freq well-worn (4) - 1 freq hello (4) - 54 freq hidey-hole (4) - 6 freq kell-heid (4) - 1 freq rely-foe (4) - 1 freq hideyhole (4) - 6 freq |
hell-hole (0) - 1 freq hellhole (2) - 2 freq tell-tale (5) - 2 freq helliehowe (5) - 1 freq bolt-hole (5) - 1 freq hell-fire (5) - 1 freq hull-o (6) - 4 freq kell-heid (6) - 1 freq healthily (6) - 1 freq yill-hoose (6) - 1 freq weill-able (6) - 1 freq hidey-hole (6) - 6 freq lug-hole (6) - 1 freq hidie-hole (6) - 4 freq hellloa (6) - 1 freq hert-holl (6) - 5 freq half-mile (6) - 1 freq hale-sale (6) - 1 freq well-heeled (6) - 1 freq kelloholm (6) - 2 freq hellebore (6) - 1 freq well-ah (7) - 1 freq hellooooo (7) - 1 freq pell-mell (7) - 2 freq het-hoose (7) - 1 freq |
SoundEx code - H440 hell-hole - 1 freq hellhole - 2 freq halely - 7 freq halleluia - 1 freq €˜halely - 1 freq holywullie - 1 freq |
MetaPhone code - HLHL hell-hole - 1 freq hellhole - 2 freq |
HELL-HOLE |
| Time to execute Levenshtein function - 0.257317 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.534931 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.067223 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.042728 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.032117 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. |