Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hooverin (0) - 5 freq hooerin (1) - 1 freq hooveran (1) - 1 freq hoovering (1) - 2 freq hoverin (1) - 22 freq hoover's (2) - 1 freq hoover (2) - 18 freq shooerin (2) - 2 freq footerin (2) - 7 freq hoovered (2) - 4 freq foonerin (2) - 1 freq hovrin (2) - 2 freq shooderin (2) - 4 freq hotterin (2) - 15 freq hoveran (2) - 1 freq haverin (2) - 24 freq hoovin (2) - 3 freq bovverin (2) - 1 freq pooerin (2) - 1 freq haiverin (2) - 18 freq tooerin (2) - 1 freq hoorin (2) - 3 freq doverin (2) - 15 freq howderin (2) - 3 freq hollerin (2) - 2 freq |
hooverin (0) - 5 freq hoverin (1) - 22 freq hooveran (1) - 1 freq haverin (2) - 24 freq haiverin (2) - 18 freq hoveran (2) - 1 freq hovrin (2) - 2 freq hooerin (2) - 1 freq hoovering (2) - 2 freq hoovin (3) - 3 freq hoover (3) - 18 freq hovering (3) - 7 freq hoorin (3) - 3 freq coverin (3) - 29 freq hoovered (3) - 4 freq doverin (3) - 15 freq hyterin (4) - 3 freq leverin (4) - 2 freq herin (4) - 2 freq heerin (4) - 3 freq hoovur (4) - 1 freq hooever (4) - 31 freq hovered (4) - 11 freq govern (4) - 3 freq shiverin (4) - 12 freq |
SoundEx code - H165 hap-wairms - 1 freq haverin - 24 freq haiverins - 2 freq hoverin - 22 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 - 24 freq hoverin - 22 freq haiverin - 18 freq hooverin - 5 freq hooveran - 1 freq hoveran - 1 freq hovrin - 2 freq haverin' - 2 freq |
HOOVERIN |
Time to execute Levenshtein function - 0.208273 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.543015 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.030448 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.037280 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.003236 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. |