| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nvch (0) - 1 freq noch (1) - 2 freq nch (1) - 2 freq bwch (2) - 1 freq ich (2) - 4 freq ch (2) - 38 freq och (2) - 706 freq dvcv (2) - 3 freq neth (2) - 5 freq naah (2) - 3 freq pech (2) - 35 freq nece (2) - 1 freq each (2) - 652 freq natch (2) - 2 freq loch (2) - 279 freq necp (2) - 1 freq aich (2) - 2 freq nact (2) - 1 freq ach (2) - 313 freq nvq (2) - 6 freq hvhh (2) - 1 freq nec (2) - 2 freq yach (2) - 1 freq nh (2) - 4 freq huch (2) - 1 freq |
nvch (0) - 1 freq nch (2) - 2 freq noch (2) - 2 freq insch (3) - 4 freq enuch (3) - 89 freq inch (3) - 51 freq niche (3) - 7 freq notch (3) - 6 freq enoch (3) - 17 freq natch (3) - 2 freq unich (3) - 1 freq nic (4) - 3 freq sch (4) - 4 freq wnvh (4) - 1 freq necd (4) - 2 freq nicht (4) - 2275 freq €œch (4) - 5 freq nith (4) - 12 freq aach (4) - 1 freq nsh (4) - 1 freq nuxh (4) - 1 freq vc (4) - 8 freq rich (4) - 192 freq €˜ch (4) - 8 freq soch (4) - 1 freq |
SoundEx code - N120 neeps - 148 freq nieves - 15 freq nebs - 42 freq nips - 27 freq naps - 2 freq neives - 10 freq nephews - 6 freq nappies - 9 freq neebs - 13 freq nevis - 5 freq nephew's - 2 freq novice - 5 freq navajo - 1 freq neep's - 3 freq nyfe's - 1 freq neeps' - 1 freq 'nephews' - 1 freq nyaffs - 6 freq nives - 2 freq nobs - 3 freq neb's - 4 freq novak - 4 freq newbies - 1 freq nbs - 1 freq naevius - 1 freq navies - 1 freq nibbies - 1 freq noviss - 1 freq nopiece - 2 freq nvq - 6 freq nippies - 3 freq nava's - 2 freq naips - 1 freq nubuck - 1 freq nvch - 1 freq nfxo - 1 freq nufc - 6 freq niviews - 1 freq nbshow - 10 freq nobxzz - 1 freq nfywssqz - 1 freq npq - 1 freq nops - 1 freq nfias - 1 freq npx - 1 freq nebs' - 1 freq nivg - 1 freq nffc - 1 freq |
MetaPhone code - NFX nvch - 1 freq |
NVCH |
| Time to execute Levenshtein function - 0.268616 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.364353 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.027855 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.039674 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.000848 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. |