| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ngugi (0) - 2 freq nui (2) - 1 freq guga (2) - 1 freq gui (2) - 1 freq nouat (3) - 1 freq heugh (3) - 4 freq ygi (3) - 1 freq nou-- (3) - 1 freq engagin (3) - 16 freq audi (3) - 1 freq nuxh (3) - 1 freq neigh (3) - 4 freq igg (3) - 1 freq naomi (3) - 14 freq 'guir (3) - 1 freq nivg (3) - 1 freq blui (3) - 1 freq gute (3) - 1 freq guig (3) - 1 freq dug (3) - 575 freq jougs (3) - 9 freq aneugh (3) - 15 freq iugw (3) - 1 freq spugh (3) - 1 freq 'bug (3) - 1 freq |
ngugi (0) - 2 freq engage (3) - 40 freq naggai (3) - 3 freq naggie (3) - 2 freq neggy (3) - 1 freq guga (3) - 1 freq eneugh (4) - 49 freq agg (4) - 6 freq gouge (4) - 1 freq neige (4) - 2 freq geg (4) - 15 freq ngho (4) - 1 freq ng (4) - 6 freq naigie (4) - 1 freq naggin (4) - 10 freq noggin (4) - 1 freq nag (4) - 6 freq languge (4) - 1 freq norge (4) - 1 freq veggi (4) - 1 freq mugug (4) - 2 freq nog (4) - 3 freq naigs (4) - 3 freq oougg (4) - 1 freq neig (4) - 1 freq |
SoundEx code - N220 noses - 20 freq noises - 32 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 - NKJ ngugi - 2 freq nwkj - 1 freq |
NGUGI |
| Time to execute Levenshtein function - 0.410182 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.898194 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.088285 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.101886 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.000798 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. |