| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hazelr (1) - 7 freq haer (1) - 18 freq haver (1) - 6 freq razer (1) - 1 freq hazel (1) - 51 freq hater (1) - 2 freq haze (1) - 20 freq hape (2) - 3 freq azor (2) - 4 freq haur (2) - 1 freq wafer (2) - 2 freq raver (2) - 4 freq hauler (2) - 1 freq haaed (2) - 1 freq hared (2) - 1 freq haert (2) - 43 freq faber (2) - 1 freq hatter (2) - 279 freq chaper (2) - 3 freq humer (2) - 1 freq hated (2) - 52 freq maer (2) - 3 freq haec (2) - 1 freq hate (2) - 195 freq naze (2) - 1 freq |
hazelr (2) - 7 freq hozier (2) - 1 freq hzr (2) - 1 freq hater (2) - 2 freq haze (2) - 20 freq haver (2) - 6 freq haer (2) - 18 freq razer (2) - 1 freq hazel (2) - 51 freq haaver (3) - 4 freq hazle (3) - 1 freq hair (3) - 902 freq dizer (3) - 1 freq homer (3) - 1 freq hyper (3) - 4 freq header (3) - 2 freq haeter (3) - 2 freq hazy (3) - 13 freq hized (3) - 1 freq eezer (3) - 1 freq har (3) - 8 freq hazard (3) - 2 freq hoker (3) - 1 freq tizer (3) - 3 freq razor (3) - 14 freq |
SoundEx code - H260 hjckrrh - 5 freq heicher - 30 freq higher - 79 freq hawker - 1 freq heecher - 1 freq hooker - 4 freq hasher - 1 freq hicher - 1 freq hozier - 1 freq hickory - 3 freq howker - 2 freq hosiery - 2 freq heigher - 1 freq hussar - 2 freq hegri - 1 freq hoker - 1 freq hcr - 2 freq haegri - 1 freq hzr - 1 freq hawickrau - 6 freq hagar - 1 freq |
MetaPhone code - HSR hozier - 1 freq hosiery - 2 freq hussar - 2 freq |
HAZER |
| Time to execute Levenshtein function - 0.188040 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.371947 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.030144 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.039001 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.001025 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. |