| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hazeldean' (1) - 1 freq hazelheed (3) - 1 freq hassendean (3) - 1 freq gaelderan (3) - 1 freq hamelan (3) - 1 freq hadean (3) - 3 freq haedan (3) - 3 freq hamelorn (4) - 2 freq heiden (4) - 1 freq haldon (4) - 1 freq hallaeen (4) - 12 freq haedin (4) - 1 freq gazelles (4) - 3 freq gazelle (4) - 7 freq haelga (4) - 2 freq eldern (4) - 4 freq andean (4) - 1 freq faelan (4) - 1 freq aberdeen (4) - 111 freq hellyan (4) - 2 freq haean (4) - 12 freq heedan (4) - 1 freq gavel-en (4) - 2 freq haeled (4) - 2 freq hazle (4) - 1 freq |
hazeldean' (2) - 1 freq holden (5) - 2 freq haldon (5) - 1 freq haedan (5) - 3 freq haldane (5) - 2 freq hadean (5) - 3 freq hauldin (5) - 4 freq howldan (5) - 4 freq hamelan (5) - 1 freq hazelheed (5) - 1 freq hampden (6) - 15 freq hamelaun (6) - 1 freq hebridean (6) - 2 freq hazel (6) - 51 freq haulen (6) - 10 freq harden (6) - 21 freq hazelnut (6) - 1 freq baldan (6) - 1 freq heelan (6) - 7 freq haaden (6) - 2 freq hielan (6) - 27 freq halfdan (6) - 5 freq haednae (6) - 8 freq helen (6) - 46 freq haalan (6) - 2 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 - 1 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 - HSLTN hazeldean' - 1 freq |
HAZELDEAN |
| Time to execute Levenshtein function - 0.225002 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.387673 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.027975 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.040800 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.000856 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. |