| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hazard (0) - 2 freq hazards (1) - 1 freq haard (1) - 17 freq harvard (2) - 2 freq hard (2) - 799 freq hoard (2) - 12 freq haurd (2) - 152 freq haaed (2) - 1 freq haand (2) - 104 freq waard (2) - 2 freq hansard (2) - 3 freq award (2) - 59 freq lizard (2) - 32 freq naard (2) - 1 freq haerd (2) - 26 freq h'ard (2) - 1 freq haggard (2) - 1 freq haad (2) - 71 freq hsard (2) - 1 freq wizard (2) - 19 freq hamar (2) - 5 freq haird (2) - 124 freq halyard (2) - 1 freq heard (2) - 1286 freq hagar (2) - 1 freq |
hazard (0) - 2 freq haard (2) - 17 freq hazards (2) - 1 freq lizard (3) - 32 freq heard (3) - 1286 freq haerd (3) - 26 freq wizard (3) - 19 freq howard (3) - 4 freq h'ard (3) - 1 freq haird (3) - 124 freq haurd (3) - 152 freq hoard (3) - 12 freq he'ard (3) - 1 freq halyard (3) - 1 freq hsard (3) - 1 freq hard (3) - 799 freq hoord (4) - 3 freq heyrd (4) - 3 freq haired (4) - 7 freq havered (4) - 7 freq harraed (4) - 2 freq huird (4) - 2 freq razored (4) - 1 freq herd (4) - 158 freq hairdo (4) - 3 freq |
SoundEx code - H263 hogwarts - 1 freq hie-cairt - 1 freq haggart - 3 freq hazardous - 1 freq hochered - 1 freq hazard - 2 freq hsard - 1 freq haizarts - 1 freq €˜hagrid - 1 freq highroad - 6 freq hazards - 1 freq haggardhawks - 2 freq haggard - 1 freq |
MetaPhone code - HSRT hazard - 2 freq |
HAZARD |
| Time to execute Levenshtein function - 0.227839 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.389230 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.027861 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.039379 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.000954 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. |