| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ncis (0) - 4 freq acis (1) - 3 freq wcis (1) - 1 freq nis (1) - 2 freq ncs (1) - 2 freq cis (1) - 26 freq neis (1) - 1 freq nit (2) - 10 freq actis (2) - 1 freq ects (2) - 4 freq rcs (2) - 2 freq acos (2) - 2 freq ns (2) - 15 freq nch (2) - 2 freq icys (2) - 1 freq wci (2) - 2 freq o'is (2) - 31 freq acts (2) - 43 freq cits (2) - 1 freq blis (2) - 1 freq mcs (2) - 1 freq ncht (2) - 5 freq nits (2) - 21 freq noisy (2) - 13 freq nisx (2) - 1 freq |
ncis (0) - 4 freq ncs (1) - 2 freq uncos (2) - 3 freq incas (2) - 1 freq ancus (2) - 2 freq neis (2) - 1 freq nicus (2) - 1 freq wcis (2) - 1 freq acis (2) - 3 freq cis (2) - 26 freq nis (2) - 2 freq necks (3) - 25 freq naps (3) - 2 freq nazis (3) - 3 freq nbs (3) - 1 freq nods (3) - 61 freq nats (3) - 2 freq nims (3) - 2 freq noise (3) - 152 freq ncer (3) - 1 freq ices (3) - 2 freq nls (3) - 6 freq nus (3) - 5 freq nuts (3) - 58 freq nops (3) - 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 - NSS noses - 20 freq noises - 33 freq nieces - 4 freq nessie's - 1 freq gnosis - 1 freq na-says - 3 freq nazis - 3 freq neice's - 1 freq nice's - 2 freq nazis' - 1 freq nauseous - 1 freq nazis - 1 freq ncis - 4 freq ns's - 1 freq nsz - 1 freq |
NCIS |
| Time to execute Levenshtein function - 0.277173 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.386643 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.027452 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.040748 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.000925 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. |