| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hinges (0) - 19 freq whinges (1) - 1 freq hings (1) - 269 freq hing's (1) - 3 freq hinger (1) - 6 freq binges (1) - 1 freq hingen (1) - 2 freq hinge (1) - 5 freq chinges (1) - 4 freq hingers (1) - 5 freq henges (1) - 1 freq jings (2) - 169 freq yingess (2) - 1 freq hingins (2) - 4 freq ringed (2) - 7 freq tings (2) - 23 freq lines (2) - 216 freq lunges (2) - 2 freq aiges (2) - 3 freq hingmy (2) - 4 freq ainger (2) - 3 freq hanged (2) - 6 freq heges (2) - 1 freq lingers (2) - 6 freq winces (2) - 2 freq |
hinges (0) - 19 freq hings (1) - 269 freq henges (1) - 1 freq whinges (2) - 1 freq hing's (2) - 3 freq hangs (2) - 3 freq ehanges (2) - 1 freq chinges (2) - 4 freq hingers (2) - 5 freq binges (2) - 1 freq hinger (2) - 6 freq hinge (2) - 5 freq hingen (2) - 2 freq hingir (3) - 1 freq hinks (3) - 19 freq kynges (3) - 1 freq hindies (3) - 1 freq bingos (3) - 1 freq gings (3) - 75 freq rings (3) - 103 freq pings (3) - 4 freq kingis (3) - 2 freq ganges (3) - 1 freq hing (3) - 567 freq hingin (3) - 369 freq |
SoundEx code - H522 hankies - 3 freq hamesick - 1 freq hinniesickle - 3 freq hen-hooses - 6 freq hinges - 19 freq hunkies - 3 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 |
HINGES |
| Time to execute Levenshtein function - 0.200877 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.383565 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.033682 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.037961 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.000856 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. |