| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| npq (0) - 1 freq nq (1) - 6 freq npx (1) - 1 freq np (1) - 5 freq npu (1) - 1 freq pq (1) - 2 freq npn (1) - 1 freq nvq (1) - 6 freq npd (1) - 1 freq nqq (1) - 1 freq mpq (1) - 1 freq ypq (1) - 1 freq jpm (2) - 1 freq njr (2) - 1 freq napa (2) - 3 freq utq (2) - 2 freq nog (2) - 3 freq nvw (2) - 1 freq apm (2) - 1 freq mpm (2) - 1 freq nn (2) - 2 freq jpu (2) - 1 freq pz (2) - 6 freq gps (2) - 4 freq nup (2) - 12 freq |
npq (0) - 1 freq nvq (2) - 6 freq nqq (2) - 1 freq ypq (2) - 1 freq npn (2) - 1 freq mpq (2) - 1 freq npd (2) - 1 freq pq (2) - 2 freq npx (2) - 1 freq np (2) - 5 freq nq (2) - 6 freq npu (2) - 1 freq nymq (3) - 1 freq naps (3) - 2 freq nop (3) - 1 freq onq (3) - 1 freq nops (3) - 1 freq pqo (3) - 1 freq nope (3) - 18 freq napp (3) - 2 freq neeq (3) - 1 freq nape (3) - 2 freq nip (3) - 119 freq nap (3) - 17 freq nips (3) - 27 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 - NPK npq - 1 freq |
NPQ |
| Time to execute Levenshtein function - 0.316354 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.507604 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.058291 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.036568 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.000878 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. |