| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| havering (0) - 2 freq haverin (1) - 25 freq hovering (1) - 7 freq haverin' (1) - 2 freq capering (2) - 1 freq having (2) - 61 freq severing (2) - 1 freq hankering (2) - 2 freq shivering (2) - 2 freq watering (2) - 1 freq haiverin (2) - 18 freq haiverins (2) - 2 freq covering (2) - 6 freq hoverin (2) - 23 freq catering (2) - 1 freq waverin (2) - 1 freq hoovering (2) - 2 freq haeing (2) - 4 freq leverin (3) - 2 freq yammering (3) - 1 freq raring (3) - 2 freq averill (3) - 1 freq havin (3) - 73 freq haepin (3) - 1 freq ravenin (3) - 1 freq |
havering (0) - 2 freq hovering (1) - 7 freq hoovering (2) - 2 freq haverin' (2) - 2 freq haverin (2) - 25 freq covering (3) - 6 freq hoverin (3) - 23 freq haiverins (3) - 2 freq haiverin (3) - 18 freq severing (3) - 1 freq shivering (3) - 2 freq having (3) - 61 freq hooverin (4) - 5 freq quivering (4) - 1 freq hiring (4) - 1 freq heaving (4) - 1 freq hoveran (4) - 1 freq heving (4) - 1 freq hearing (4) - 24 freq hiving (4) - 1 freq hovrin (4) - 2 freq herring (4) - 3 freq favouring (4) - 1 freq waverin (4) - 1 freq watering (4) - 1 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 - HFRNK hovering - 7 freq havering - 2 freq hoovering - 2 freq |
HAVERING |
| Time to execute Levenshtein function - 0.222914 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.382433 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.032506 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.046511 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.001188 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. |