| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hangover (0) - 10 freq hangower (1) - 3 freq hanover (1) - 5 freq hangovers (1) - 2 freq hungover (1) - 3 freq hungower (2) - 1 freq hanger (2) - 3 freq hanovers (2) - 1 freq hingower (2) - 1 freq handler (3) - 1 freq haiver (3) - 6 freq ganger (3) - 1 freq sangster (3) - 24 freq hoanever (3) - 1 freq angrier (3) - 6 freq hinger (3) - 6 freq whaniver (3) - 108 freq fanivver (3) - 6 freq handier (3) - 1 freq hunger (3) - 46 freq gangster (3) - 7 freq ranger (3) - 8 freq takeover (3) - 2 freq hanker (3) - 3 freq changer (3) - 3 freq |
hangover (0) - 10 freq hungover (1) - 3 freq hangovers (2) - 2 freq hanover (2) - 5 freq hangower (2) - 3 freq hingower (3) - 1 freq hungower (3) - 1 freq hanger (3) - 3 freq hoanever (4) - 1 freq hinger (4) - 6 freq hoanivver (4) - 1 freq hunger (4) - 46 freq hanovers (4) - 1 freq hansper (5) - 1 freq hoover (5) - 18 freq hanged (5) - 6 freq whanivver (5) - 11 freq hover (5) - 9 freq whanever (5) - 8 freq sanger (5) - 1 freq anger (5) - 68 freq bangor (5) - 9 freq fanger (5) - 1 freq haver (5) - 6 freq hing-ower (5) - 1 freq |
SoundEx code - H521 hings-everythin - 1 freq haunspikes - 1 freq hungover - 3 freq haancuffs - 6 freq henceforth - 2 freq hangover - 10 freq hanky-panky - 1 freq hung-up - 1 freq haunspail - 1 freq homespun - 1 freq hansper - 1 freq haancuff - 4 freq hemisphere - 2 freq hangblaa - 1 freq hangovers - 2 freq hngqpepv - 1 freq hmmkzv - 1 freq hmwzfubk - 1 freq |
MetaPhone code - HNKFR hungover - 3 freq hangover - 10 freq |
HANGOVER |
| Time to execute Levenshtein function - 0.186458 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.340463 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.028816 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.036894 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.000822 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. |