Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hinsicht (0) - 1 freq insicht (1) - 19 freq hindsicht (1) - 1 freq insieht (2) - 1 freq sinlicht (2) - 8 freq insichts (2) - 8 freq inicht (2) - 2 freq insight (2) - 5 freq hielicht (2) - 3 freq hindsight (2) - 1 freq instict (3) - 1 freq hindit (3) - 1 freq midnicht (3) - 57 freq eesicht (3) - 3 freq o'sicht (3) - 1 freq arnicht (3) - 1 freq oersicht (3) - 1 freq hicht (3) - 47 freq i'licht (3) - 3 freq heidlicht (3) - 1 freq skinticht (3) - 1 freq itricht (3) - 1 freq unsocht (3) - 1 freq indict (3) - 1 freq sennicht (3) - 10 freq |
hinsicht (0) - 1 freq hindsicht (2) - 1 freq insicht (2) - 19 freq hielicht (4) - 3 freq unsocht (4) - 1 freq insight (4) - 5 freq hindsight (4) - 1 freq insieht (4) - 1 freq inicht (4) - 2 freq sinlicht (4) - 8 freq insichts (4) - 8 freq insichtfu (5) - 1 freq thenicht (5) - 4 freq forsicht (5) - 1 freq insch (5) - 4 freq danicht (5) - 4 freq hinch (5) - 2 freq sunlicht (5) - 43 freq finisht (5) - 14 freq knicht (5) - 15 freq foirsicht (5) - 1 freq nicht (5) - 2275 freq muinlicht (5) - 18 freq unricht (5) - 1 freq heinrich (5) - 3 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 - HNSXT hinsicht - 1 freq |
HINSICHT |
Time to execute Levenshtein function - 0.208790 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.413621 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.030837 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.037184 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.000916 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. |