| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nachos (0) - 1 freq machts (2) - 2 freq nahor (2) - 3 freq nashous (2) - 1 freq vrachos (2) - 1 freq echos (2) - 2 freq nacht (2) - 2 freq macdos (2) - 1 freq naxos (2) - 2 freq chos (2) - 1 freq nichols (2) - 27 freq aches (2) - 10 freq yachts (2) - 2 freq macho (2) - 9 freq niches (2) - 1 freq nochts (2) - 1 freq nacrous (2) - 1 freq lachs (2) - 3 freq nichol (2) - 25 freq sachs (2) - 4 freq nichts (2) - 159 freq acos (2) - 2 freq pathos (2) - 5 freq nice's (3) - 2 freq nahz (3) - 1 freq |
nachos (0) - 1 freq niches (2) - 1 freq nochts (3) - 1 freq aches (3) - 10 freq nacrous (3) - 1 freq sachs (3) - 4 freq inches (3) - 98 freq nichts (3) - 159 freq nichols (3) - 27 freq nichol (3) - 25 freq lachs (3) - 3 freq nashous (3) - 1 freq echos (3) - 2 freq nacht (3) - 2 freq chos (3) - 1 freq inchis (3) - 1 freq nicher (4) - 5 freq nochty (4) - 1 freq chaos (4) - 24 freq pechs (4) - 6 freq eunuchs (4) - 2 freq apaches (4) - 3 freq beaches (4) - 12 freq sauchs (4) - 9 freq coaches (4) - 9 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 - NXS niches - 1 freq nashous - 1 freq gnashes - 1 freq notches - 1 freq nachos - 1 freq knashes - 1 freq |
NACHOS |
| Time to execute Levenshtein function - 0.197831 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.394426 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.030487 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.044067 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.000979 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. |