| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nvq (0) - 6 freq nv (1) - 5 freq npq (1) - 1 freq nvr (1) - 2 freq nq (1) - 6 freq nvt (1) - 1 freq nqq (1) - 1 freq vvq (1) - 1 freq nva (1) - 2 freq xvq (1) - 1 freq nvw (1) - 1 freq vq (1) - 6 freq nvm (1) - 1 freq nee (2) - 14 freq neeq (2) - 1 freq nn (2) - 2 freq ndr (2) - 1 freq ncs (2) - 2 freq yvh (2) - 1 freq tcq (2) - 1 freq pnq (2) - 1 freq pq (2) - 2 freq mvk (2) - 1 freq znzq (2) - 1 freq qv (2) - 3 freq |
nvq (0) - 6 freq nva (2) - 2 freq xvq (2) - 1 freq vq (2) - 6 freq vvq (2) - 1 freq nvw (2) - 1 freq nvm (2) - 1 freq npq (2) - 1 freq nqq (2) - 1 freq nvr (2) - 2 freq nv (2) - 5 freq nvt (2) - 1 freq nq (2) - 6 freq envy (3) - 25 freq sovq (3) - 1 freq invy (3) - 2 freq onq (3) - 1 freq nov (3) - 4 freq bvqo (3) - 1 freq nev (3) - 6 freq nava (3) - 30 freq nivg (3) - 1 freq nymq (3) - 1 freq niv (3) - 5 freq najq (3) - 1 freq |
SoundEx code - N120 neeps - 148 freq nieves - 15 freq nebs - 41 freq nips - 27 freq naps - 2 freq neives - 10 freq nephews - 6 freq nappies - 9 freq neebs - 13 freq nevis - 4 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 - NFK novak - 4 freq nvq - 6 freq nufc - 6 freq nivg - 1 freq nffc - 1 freq |
NVQ |
| Time to execute Levenshtein function - 0.158032 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.299711 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.026932 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.036112 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.000850 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. |