| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| neesick (0) - 1 freq meesick (1) - 2 freq neesicks (1) - 1 freq neesik (1) - 2 freq meesic (2) - 11 freq jeemick (2) - 2 freq teeick (2) - 2 freq neesiks (2) - 1 freq jeemicky (3) - 30 freq njesi (3) - 1 freq veesior (3) - 1 freq negleck (3) - 7 freq neekid (3) - 2 freq lerrick (3) - 4 freq neebin (3) - 2 freq pheesic (3) - 4 freq perfick (3) - 2 freq lerwick (3) - 19 freq eesicht (3) - 3 freq kessock (3) - 1 freq kenefick (3) - 1 freq neebit (3) - 2 freq meestic (3) - 2 freq needid (3) - 1 freq feerich (3) - 1 freq |
neesick (0) - 1 freq neesicks (2) - 1 freq neesik (2) - 2 freq meesick (2) - 2 freq sick (4) - 150 freq musick (4) - 10 freq seick (4) - 7 freq nick (4) - 133 freq inseck (4) - 1 freq seeck (4) - 23 freq neck (4) - 328 freq jeemick (4) - 2 freq meesic (4) - 11 freq neesiks (4) - 1 freq teeick (4) - 2 freq nescol (5) - 1 freq nyuck (5) - 1 freq mendick (5) - 1 freq hamesick (5) - 1 freq eesce (5) - 1 freq poosack (5) - 3 freq elbick (5) - 3 freq enack (5) - 1 freq saick (5) - 1 freq nock (5) - 14 freq |
SoundEx code - N220 noses - 20 freq noises - 33 freq noxious - 2 freq nice-guy - 1 freq nieces - 4 freq nukes - 2 freq nessie's - 1 freq na-says - 3 freq neesick - 1 freq niches - 1 freq nazis - 3 freq nickie's - 1 freq niseach - 1 freq nashous - 1 freq neice's - 1 freq ngugi - 2 freq nikies - 1 freq nice's - 2 freq neesik - 2 freq nazis' - 1 freq naxos - 2 freq nauseous - 1 freq nazis - 1 freq nachos - 1 freq nngakh - 1 freq naequeues - 1 freq ngaeki - 1 freq nghs - 1 freq ncis - 4 freq neiges - 1 freq nicus - 1 freq nikki's - 1 freq nhxgas - 1 freq njesi - 1 freq neesiks- - 1 freq neesiks - 1 freq nizjex - 1 freq nkazxz - 1 freq nzyk - 1 freq nikkis - 1 freq neesicks - 1 freq |
MetaPhone code - NSK nice-guy - 1 freq neesick - 1 freq neesik - 2 freq gnsg - 1 freq nzyk - 1 freq |
NEESICK |
| Time to execute Levenshtein function - 0.189756 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.342799 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.027797 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.036646 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.000924 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. |