| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hangover (0) - 13 freq hungover (1) - 5 freq hangovers (1) - 4 freq hangower (1) - 3 freq hanover (1) - 5 freq hanovers (2) - 1 freq hungower (2) - 1 freq hingower (2) - 1 freq hanger (2) - 3 freq hangers (3) - 1 freq minoover (3) - 1 freq haver (3) - 6 freq allover (3) - 3 freq hameower (3) - 3 freq sangster (3) - 24 freq landrover (3) - 4 freq manger (3) - 11 freq amgove (3) - 1 freq ganger (3) - 1 freq sangobeg (3) - 1 freq handier (3) - 1 freq hinger (3) - 6 freq gangster (3) - 7 freq bangor (3) - 9 freq hoanever (3) - 1 freq |
hangover (0) - 13 freq hungover (1) - 5 freq hanover (2) - 5 freq hangower (2) - 3 freq hangovers (2) - 4 freq hanger (3) - 3 freq hingower (3) - 1 freq hungower (3) - 1 freq hinger (4) - 6 freq hoanever (4) - 1 freq hungaer (4) - 1 freq hunger (4) - 50 freq hoanivver (4) - 1 freq hanovers (4) - 1 freq changer (5) - 3 freq hing-ower (5) - 1 freq faniver (5) - 1 freq haundower (5) - 1 freq ranger (5) - 8 freq angler (5) - 1 freq hoover (5) - 18 freq langer (5) - 227 freq houaniver (5) - 11 freq hanker (5) - 3 freq hansper (5) - 1 freq |
SoundEx code - H521 hings-everythin - 1 freq haunspikes - 1 freq hungover - 5 freq haancuffs - 6 freq henceforth - 2 freq hangover - 13 freq hings've - 1 freq hangovers - 4 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 hngqpepv - 1 freq hmmkzv - 1 freq hmwzfubk - 1 freq |
MetaPhone code - HNKFR hungover - 5 freq hangover - 13 freq |
HANGOVER |
| Time to execute Levenshtein function - 0.200478 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.372231 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.028658 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.039677 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.001003 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. |