| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hazelheed (0) - 1 freq hazelrawed (3) - 2 freq haeled (3) - 2 freq haeted (4) - 1 freq cave-heid (4) - 2 freq hameland (4) - 7 freq hullheid (4) - 1 freq dazzled (4) - 2 freq havered (4) - 7 freq hillhead (4) - 2 freq hameless (4) - 17 freq hillheid (4) - 2 freq feelheid (4) - 1 freq harled (4) - 6 freq hallooed (4) - 1 freq hazels (4) - 2 freq owerheed (4) - 1 freq haaled (4) - 21 freq hawalleen (4) - 1 freq hameseek (4) - 3 freq baeheid (4) - 1 freq hannled (4) - 2 freq hollaeed (4) - 1 freq haeved (4) - 2 freq halted (4) - 2 freq |
hazelheed (0) - 1 freq hillheid (5) - 2 freq hillhead (5) - 2 freq hullheid (5) - 1 freq hazelrawed (5) - 2 freq haeled (5) - 2 freq halped (6) - 2 freq hashed (6) - 4 freq heeled (6) - 1 freq hallowed (6) - 4 freq hazelnut (6) - 1 freq hailsed (6) - 2 freq halved (6) - 2 freq haunled (6) - 8 freq hazle (6) - 1 freq haughheid (6) - 1 freq haled (6) - 1 freq hallaed (6) - 1 freq hie-heid (6) - 3 freq halled (6) - 2 freq hazelr (6) - 7 freq hauled (6) - 21 freq haughed (6) - 1 freq heched (6) - 1 freq hailed (6) - 14 freq |
SoundEx code - H243 haglet - 1 freq huckled - 12 freq heckled - 1 freq hauchled - 1 freq higgeldy-piggeldy - 1 freq hochlet - 1 freq higgledy - 1 freq hoosehold - 12 freq huckelt - 2 freq hochled - 1 freq haggult - 1 freq household - 10 freq heckelt - 1 freq heukelt - 2 freq hoosehald - 1 freq higgledy-piggledy - 1 freq higgelty-piggelty - 1 freq heighlit - 1 freq heich-leid - 1 freq hechl't - 2 freq hochl't - 2 freq hazeldean' - 1 freq hickled - 1 freq hacklet - 1 freq hechlet - 1 freq househald - 2 freq high-heeled - 1 freq hoosehauld - 2 freq hushlet - 1 freq hagglet - 2 freq higgilty - 1 freq hazelheed - 1 freq hooseholds - 1 freq |
MetaPhone code - HSLHT hazelheed - 1 freq |
HAZELHEED |
| Time to execute Levenshtein function - 0.239325 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.393370 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.028330 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.041146 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.000900 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. |