| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haiverel (0) - 1 freq aiverel (1) - 1 freq haivered (1) - 2 freq haiverin (2) - 18 freq havered (2) - 7 freq haivers (2) - 31 freq naiterel (2) - 1 freq saiveral (2) - 6 freq haiverers (2) - 1 freq haiver (2) - 6 freq saivrel (2) - 12 freq haived (3) - 10 freq raivel (3) - 3 freq davered (3) - 1 freq hammered (3) - 11 freq haimerin (3) - 1 freq taivers (3) - 3 freq whaiver (3) - 30 freq caiver (3) - 1 freq haiveless (3) - 1 freq whaiver's (3) - 2 freq daivert (3) - 2 freq naitered (3) - 1 freq haiven' (3) - 1 freq maitered (3) - 2 freq |
haiverel (0) - 1 freq aiverel (2) - 1 freq haivered (2) - 2 freq saiveral (3) - 6 freq saivrel (3) - 12 freq haiver (3) - 6 freq haivers (3) - 31 freq haiverin (3) - 18 freq havered (3) - 7 freq havert (4) - 1 freq haaver (4) - 4 freq haavert (4) - 1 freq haverin (4) - 24 freq hoovered (4) - 4 freq haver (4) - 6 freq hovered (4) - 11 freq havers (4) - 35 freq havera (4) - 2 freq naiterel (4) - 1 freq haiverers (4) - 1 freq hovel (5) - 4 freq taivern (5) - 14 freq caiver (5) - 1 freq ivered (5) - 4 freq shivered (5) - 6 freq |
SoundEx code - H164 haiverel - 1 freq hyper-alertness - 1 freq |
MetaPhone code - HFRL haiverel - 1 freq |
HAIVEREL |
| Time to execute Levenshtein function - 0.333687 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.803772 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.080504 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.097959 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.001114 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. |