| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haurd-heidit (0) - 1 freq daurk-heidit (2) - 2 freq bauld-heidit (2) - 1 freq hale-heidit (3) - 5 freq fair-heidit (3) - 2 freq hail-heidit (3) - 2 freq airy-heidit (3) - 1 freq haill-heidit (3) - 2 freq hard-neckit (4) - 1 freq hie-heidit (4) - 1 freq baa-heidit (4) - 1 freq heich-heidit (4) - 6 freq het-heidit (4) - 1 freq reed-heidit (4) - 1 freq dug-heidit (4) - 2 freq tuim-heidit (4) - 4 freq saft-heidit (4) - 1 freq bull-heidit (4) - 2 freq rid-heidit (4) - 2 freq hauf-hertit (4) - 1 freq half-hoidit (4) - 1 freq curly-heidit (4) - 1 freq reid-heidit (4) - 5 freq lang-heidit (4) - 15 freq haird-hairtit (4) - 1 freq |
haurd-heidit (0) - 1 freq bauld-heidit (4) - 1 freq daurk-heidit (4) - 2 freq reid-heidit (5) - 5 freq rid-heidit (5) - 2 freq haill-heidit (5) - 2 freq airy-heidit (5) - 1 freq fair-heidit (5) - 2 freq reed-heidit (5) - 1 freq hail-heidit (5) - 2 freq hale-heidit (5) - 5 freq haird-hairtit (6) - 1 freq curly-heidit (6) - 1 freq half-hoidit (6) - 1 freq heich-heidit (6) - 6 freq hie-heidit (6) - 1 freq het-heidit (6) - 1 freq peerie-heidit (7) - 4 freq dug-heidit (7) - 2 freq hard-neckit (7) - 1 freq preen-heidit (7) - 1 freq grey-heidit (7) - 1 freq het-heidet (7) - 1 freq rid-heiddit (7) - 2 freq hard-hittin (7) - 1 freq |
SoundEx code - H633 hurtit - 16 freq hereditary - 4 freq hertit - 18 freq herdit - 8 freq hearted - 5 freq hurtet - 2 freq hairtet - 1 freq haurd-heidit - 1 freq herted - 6 freq hurted - 2 freq hairy-tatties - 1 freq herdeth - 1 freq hard-edged - 1 freq hortative - 1 freq hairted - 2 freq hairt-attack - 1 freq hard-hittin - 1 freq herodotus - 1 freq hertitly - 1 freq herded - 1 freq hairtedly - 1 freq hertitsome - 1 freq hertitness - 1 freq hirded - 1 freq |
MetaPhone code - HRTHTT haurd-heidit - 1 freq |
HAURD-HEIDIT |
| Time to execute Levenshtein function - 0.214337 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.426222 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.028169 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.041226 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.000981 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. |