| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hunkses (0) - 1 freq hunkies (1) - 3 freq hunksed (1) - 1 freq hunnies (2) - 1 freq junkies (2) - 9 freq hunker (2) - 12 freq huckles (2) - 1 freq hankies (2) - 3 freq dunkies (2) - 1 freq hunkie- (2) - 1 freq hunkers (2) - 11 freq hunnles (2) - 1 freq runkles (2) - 1 freq hunkled (2) - 1 freq hunkie (2) - 20 freq hunsed (2) - 1 freq unnser (3) - 8 freq uses (3) - 47 freq dunches (3) - 1 freq whulkies (3) - 1 freq handsel (3) - 7 freq huns (3) - 10 freq hundreds (3) - 10 freq hoarses (3) - 5 freq haunnles (3) - 2 freq |
hunkses (0) - 1 freq hunkies (2) - 3 freq hunksed (2) - 1 freq hunkers (3) - 11 freq hankies (3) - 3 freq hunkie (4) - 20 freq hunkled (4) - 1 freq honks (4) - 1 freq hnks (4) - 1 freq hanks (4) - 2 freq runkles (4) - 1 freq hinks (4) - 19 freq hunsed (4) - 1 freq hunnles (4) - 1 freq junkies (4) - 9 freq hunnies (4) - 1 freq huckles (4) - 1 freq hunker (4) - 12 freq hunkie- (4) - 1 freq dunkies (4) - 1 freq hunders (5) - 25 freq hinnies (5) - 6 freq henhooses (5) - 1 freq hisses (5) - 4 freq hunk (5) - 5 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 - HNKSS hunkses - 1 freq |
HUNKSES |
| Time to execute Levenshtein function - 0.261354 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.581318 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.066311 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.050421 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.001109 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. |