| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hameseek (0) - 3 freq homseek (2) - 1 freq hamesick (2) - 1 freq hameower (3) - 3 freq havester (3) - 1 freq hamelie (3) - 2 freq hame-sick (3) - 1 freq hameless (3) - 17 freq hamewark (3) - 5 freq beseek (3) - 1 freq hamster (3) - 6 freq meuseek (3) - 1 freq hamesteid (3) - 3 freq hamebrew (3) - 1 freq hamewirk (3) - 2 freq jameses (3) - 1 freq hames (3) - 51 freq hamewurk (3) - 1 freq hamework (3) - 10 freq jamesie (3) - 2 freq homesick (3) - 1 freq hairtseek (3) - 1 freq haister (4) - 2 freq haesna (4) - 53 freq hesped (4) - 1 freq |
hameseek (0) - 3 freq homseek (2) - 1 freq hamesick (3) - 1 freq hames (4) - 51 freq homesick (4) - 1 freq meuseek (4) - 1 freq damask (5) - 2 freq hairtseek (5) - 1 freq namesake (5) - 4 freq hask (5) - 4 freq hamish (5) - 46 freq harsk (5) - 3 freq haimes (5) - 3 freq hams (5) - 10 freq himes (5) - 4 freq homes (5) - 10 freq jamesie (5) - 2 freq himsael (5) - 4 freq humsel (5) - 3 freq hamework (5) - 10 freq hameless (5) - 17 freq hamewark (5) - 5 freq hame-sick (5) - 1 freq hamelie (5) - 2 freq hameower (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 - HMSK hamesick - 1 freq hameseek - 3 freq hame-sick - 1 freq homseek - 1 freq homesick - 1 freq |
HAMESEEK |
| Time to execute Levenshtein function - 0.240412 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.470520 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.032473 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.037253 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.000918 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. |