| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| neiges (0) - 1 freq neige (1) - 2 freq neiger (1) - 1 freq neives (1) - 10 freq verges (2) - 5 freq naigs (2) - 3 freq heizes (2) - 7 freq leives (2) - 3 freq reinges (2) - 5 freq seige (2) - 1 freq teigers (2) - 2 freq weires (2) - 1 freq feires (2) - 1 freq eiged (2) - 1 freq nedes (2) - 2 freq wedges (2) - 1 freq ledges (2) - 3 freq neipers (2) - 2 freq henges (2) - 1 freq peges (2) - 1 freq neiver (2) - 1 freq neig (2) - 1 freq neigh (2) - 4 freq neil's (2) - 4 freq nudges (2) - 4 freq |
neiges (0) - 1 freq naigs (2) - 3 freq neives (2) - 10 freq neige (2) - 2 freq neiger (2) - 1 freq heges (3) - 1 freq eiggs (3) - 8 freq leigs (3) - 5 freq nines (3) - 12 freq nudges (3) - 4 freq noises (3) - 33 freq eines (3) - 3 freq niger (3) - 1 freq vaiges (3) - 1 freq aedges (3) - 3 freq edges (3) - 32 freq neis (3) - 1 freq naimes (3) - 5 freq aiges (3) - 3 freq nigel (3) - 49 freq nives (3) - 2 freq ngs (3) - 1 freq nags (3) - 4 freq reinges (3) - 5 freq henges (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 - NJS nudges - 4 freq njzo - 1 freq neiges - 1 freq njesi - 1 freq |
NEIGES |
| Time to execute Levenshtein function - 0.172109 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.326046 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.031553 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.036574 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.000893 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. |