| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haiverin (0) - 18 freq haimerin (1) - 1 freq haverin (1) - 25 freq haiverins (1) - 2 freq shiverin (2) - 12 freq hammerin (2) - 18 freq hairin (2) - 3 freq slaiverin (2) - 3 freq haimmerin (2) - 6 freq hankerin (2) - 3 freq haivers (2) - 32 freq claiverin (2) - 1 freq haiven (2) - 34 freq haiver (2) - 6 freq haiverel (2) - 1 freq quiverin (2) - 7 freq hooverin (2) - 5 freq haivin (2) - 3 freq raivelin (2) - 2 freq cuiverin (2) - 1 freq kiverin (2) - 2 freq taivern (2) - 14 freq havering (2) - 2 freq aiverie (2) - 3 freq hoverin (2) - 23 freq |
haiverin (0) - 18 freq haverin (1) - 25 freq hoverin (2) - 23 freq hooverin (2) - 5 freq haiverins (2) - 2 freq haimerin (2) - 1 freq havering (3) - 2 freq taivern (3) - 14 freq kiverin (3) - 2 freq cuiverin (3) - 1 freq haverin' (3) - 2 freq hovrin (3) - 2 freq hooveran (3) - 1 freq raivern (3) - 1 freq haivin (3) - 3 freq haivered (3) - 2 freq waverin (3) - 1 freq hoveran (3) - 1 freq haivers (3) - 32 freq shiverin (3) - 12 freq hairin (3) - 3 freq haiven (3) - 34 freq quiverin (3) - 7 freq haiverel (3) - 1 freq haiver (3) - 6 freq |
SoundEx code - H165 hap-wairms - 1 freq haverin - 25 freq haiverins - 2 freq hoverin - 23 freq haiverin - 18 freq hovering - 7 freq huif-prents - 1 freq hepburn - 6 freq hibernate - 6 freq hovernut - 3 freq hovernuts - 2 freq hibernatin - 6 freq hooverin - 5 freq hooveran - 1 freq hoveran - 1 freq hepburns - 1 freq hubberin - 1 freq havering - 2 freq haparanda - 1 freq hyperion - 1 freq hibernians - 1 freq €˜hiberno-inglish - 1 freq hiberno-inglish - 9 freq hypernova - 1 freq hovrin - 2 freq hyperion's - 1 freq hibernation - 1 freq haverin' - 2 freq hoovering - 2 freq hiberno - 1 freq hibernianfc - 5 freq hypermobile - 1 freq hibeernian - 1 freq hibernating - 1 freq |
MetaPhone code - HFRN haverin - 25 freq hoverin - 23 freq haiverin - 18 freq hooverin - 5 freq hooveran - 1 freq hoveran - 1 freq hovrin - 2 freq haverin' - 2 freq |
HAIVERIN |
| Time to execute Levenshtein function - 0.295275 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.557930 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.061455 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.037618 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.000924 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. |