| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| henges (0) - 1 freq heges (1) - 1 freq chenges (1) - 16 freq hedges (1) - 38 freq hinges (1) - 19 freq cherges (2) - 2 freq changes (2) - 58 freq binges (2) - 1 freq fences (2) - 22 freq neiges (2) - 1 freq hen's (2) - 9 freq gengis (2) - 1 freq reneges (2) - 1 freq hings (2) - 298 freq hunger (2) - 50 freq helgas (2) - 1 freq tenses (2) - 8 freq heughs (2) - 7 freq hegel (2) - 2 freq heaves (2) - 2 freq cheynges (2) - 7 freq hence (2) - 33 freq menses (2) - 1 freq hanger (2) - 3 freq genes (2) - 11 freq |
henges (0) - 1 freq hinges (1) - 19 freq hings (2) - 298 freq hangs (2) - 3 freq ehanges (2) - 1 freq hedges (2) - 38 freq chenges (2) - 16 freq heges (2) - 1 freq hangers (3) - 1 freq tengs (3) - 2 freq thengs (3) - 1 freq chynges (3) - 53 freq gengs (3) - 15 freq heng (3) - 4 freq reinges (3) - 5 freq ranges (3) - 2 freq hingen (3) - 2 freq hennis (3) - 1 freq chaenges (3) - 3 freq cheenges (3) - 1 freq ganges (3) - 1 freq hengin (3) - 3 freq hinge (3) - 5 freq wheenges (3) - 1 freq hanles (3) - 1 freq |
SoundEx code - H522 hankies - 3 freq hamesick - 1 freq hinniesickle - 3 freq hen-hooses - 6 freq hinges - 19 freq hunkies - 3 freq huunnnggggag - 1 freq hameseek - 3 freq hancock's - 1 freq hame-sick - 1 freq hamish's - 1 freq henges - 1 freq homseek - 1 freq haenhooses - 1 freq hansa's - 1 freq hunghsin - 1 freq hameseikness - 1 freq hingoseed - 1 freq haunshake - 2 freq henhooses - 1 freq hens'eggs - 1 freq homosexuality - 2 freq ham-sized - 1 freq hinsicht - 1 freq hunkses - 1 freq hameseeckness - 1 freq hameseekness - 1 freq hamesucken - 2 freq homesick - 1 freq humzayousaf - 5 freq hancock - 3 freq hamesicknow - 1 freq hamecookin - 1 freq |
MetaPhone code - HNJS hinges - 19 freq henges - 1 freq |
HENGES |
| Time to execute Levenshtein function - 0.214938 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.411209 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.029944 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.037624 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.000974 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. |