Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hannothehibbie (0) - 1 freq hannahhiles (7) - 1 freq annoyince (8) - 2 freq haurd-heidit (8) - 1 freq hale-heidit (8) - 5 freq cantilie (8) - 1 freq 'another (8) - 2 freq slapntheheid (8) - 1 freq warthwhile (8) - 1 freq antiquitie (8) - 2 freq genteelitie (8) - 2 freq mannikie (8) - 1 freq hypnotise (8) - 1 freq cahootchie (8) - 2 freq tibbie (8) - 10 freq hailthie (8) - 1 freq anesthetic (8) - 1 freq catherine (8) - 12 freq anisthetic (8) - 1 freq hypotheticals (8) - 1 freq hinodegiri (8) - 1 freq hypothesis (8) - 1 freq hypothetical- (8) - 1 freq anothers (8) - 1 freq camsteirie (8) - 3 freq |
hannothehibbie (0) - 1 freq hannahhiles (10) - 1 freq hannahb (11) - 6 freq kenthehorse (12) - 1 freq hannibal (12) - 1 freq anthroboi (12) - 1 freq contreibute (13) - 1 freq hinnereine (13) - 1 freq hinnerlie (13) - 10 freq mannheim (13) - 1 freq hannah (13) - 10 freq northumbria (13) - 10 freq haun-tillin (13) - 1 freq vauntyhike (13) - 1 freq hibbie (13) - 2 freq nebbie (13) - 9 freq fantousherie (13) - 1 freq hauf-thrie (13) - 1 freq habbie (13) - 9 freq wunnther (13) - 1 freq anaesthetise (13) - 1 freq stanthemannie (13) - 1 freq hypnotisin (13) - 1 freq onthebaw (13) - 1 freq haelthie (13) - 1 freq |
SoundEx code - H531 haund-fest - 1 freq handbag - 21 freq haund-for-haund - 2 freq haundbag - 4 freq haematopus - 1 freq handbeg - 1 freq haundbuik - 1 freq haundfus - 3 freq haundfu - 13 freq handful - 3 freq handfu - 10 freq handwoven - 1 freq haund-wuiven - 1 freq haundbook - 1 freq handbrake - 3 freq haandfoo - 1 freq haandbag - 1 freq handfastin - 1 freq haundfast - 1 freq handfae - 2 freq haund-for-nieve - 1 freq handbags - 2 freq haundful - 1 freq handfoo - 1 freq handbook - 1 freq hannothehibbie - 1 freq handpicked - 1 freq |
MetaPhone code - HN0HB hannothehibbie - 1 freq |
HANNOTHEHIBBIE |
Time to execute Levenshtein function - 0.227292 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.443016 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.033740 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.038255 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.001002 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. |