| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| njesi (0) - 1 freq nei (2) - 1 freq nes (2) - 1 freq jei (2) - 1 freq nesh (2) - 4 freq neest (2) - 88 freq desi (2) - 1 freq njsl (2) - 1 freq nisi (2) - 5 freq unjest (2) - 1 freq niest (2) - 2 freq niemi (2) - 1 freq kwesi (2) - 1 freq neri (2) - 3 freq neesik (2) - 2 freq jess (2) - 21 freq jest (2) - 80 freq ness (2) - 41 freq jesu (2) - 2 freq nest (2) - 81 freq axes (3) - 23 freq jeck (3) - 16 freq mess (3) - 103 freq eso (3) - 1 freq resin (3) - 6 freq |
njesi (0) - 1 freq nisi (3) - 5 freq enjose (3) - 3 freq ness (3) - 41 freq jesu (3) - 2 freq njsl (3) - 1 freq unjest (3) - 1 freq nes (3) - 1 freq nosie (4) - 1 freq nyse (4) - 2 freq nads (4) - 1 freq anes (4) - 222 freq naise (4) - 2 freq neeps (4) - 148 freq nods (4) - 61 freq namesy (4) - 1 freq neyse (4) - 1 freq noisy (4) - 13 freq ngs (4) - 1 freq njk (4) - 1 freq josu (4) - 1 freq njal (4) - 8 freq njoosin (4) - 1 freq njc (4) - 1 freq injoys (4) - 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 - NJS nudges - 4 freq njzo - 1 freq neiges - 1 freq njesi - 1 freq |
NJESI |
| Time to execute Levenshtein function - 0.212024 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.363046 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.029419 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.038193 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.000929 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. |