Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
neesiks- (0) - 1 freq neesiks (1) - 1 freq veesiks (2) - 2 freq neesicks (2) - 1 freq neesik (2) - 2 freq peesies (3) - 2 freq feetiks (3) - 1 freq neebirs (3) - 9 freq newsins (3) - 4 freq neesick (3) - 1 freq jeesis (3) - 2 freq weesks (3) - 1 freq veesits (3) - 15 freq nemesis (3) - 2 freq neediest (3) - 1 freq veesion (4) - 25 freq heevins (4) - 4 freq newsing (4) - 1 freq neems (4) - 7 freq veesitor (4) - 21 freq veesitin (4) - 31 freq eesin (4) - 1 freq leeshins (4) - 1 freq veesior (4) - 1 freq aesiest (4) - 1 freq |
neesiks- (0) - 1 freq neesiks (2) - 1 freq neesik (4) - 2 freq neesicks (4) - 1 freq veesiks (4) - 2 freq weesks (5) - 1 freq onesies (6) - 1 freq necks (6) - 25 freq neuks (6) - 30 freq seeks (6) - 24 freq siks (6) - 4 freq nest- (6) - 1 freq ness (6) - 41 freq nestis (6) - 1 freq neck- (6) - 1 freq nories- (6) - 1 freq nests (6) - 27 freq esks (6) - 2 freq beseiks (6) - 1 freq seiks (6) - 1 freq nekst (6) - 1 freq neebirs (6) - 9 freq nemesis (6) - 2 freq newsins (6) - 4 freq neesick (6) - 1 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 - NSKS nisx - 1 freq nsxo - 1 freq neesiks- - 1 freq neesiks - 1 freq neesicks - 1 freq |
NEESIKS- |
Time to execute Levenshtein function - 0.198891 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.338933 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.027713 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.037606 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.000862 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. |