| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nbs (0) - 1 freq nus (1) - 5 freq obs (1) - 1 freq nes (1) - 1 freq bs (1) - 6 freq ibs (1) - 3 freq ncs (1) - 2 freq nobs (1) - 3 freq nls (1) - 6 freq nhs (1) - 38 freq nts (1) - 1 freq nebs (1) - 41 freq nis (1) - 2 freq rbs (1) - 1 freq nms (1) - 2 freq pbs (1) - 1 freq nb (1) - 4 freq abs (1) - 1 freq vbs (1) - 1 freq ns (1) - 15 freq ngs (1) - 1 freq mbs (1) - 2 freq snb (2) - 2 freq ne' (2) - 1 freq ab's (2) - 1 freq |
nbs (0) - 1 freq nobs (1) - 3 freq nebs (1) - 41 freq nb (2) - 4 freq pbs (2) - 1 freq nms (2) - 2 freq vbs (2) - 1 freq neebs (2) - 13 freq mbs (2) - 2 freq ngs (2) - 1 freq rbs (2) - 1 freq abs (2) - 1 freq ns (2) - 15 freq bs (2) - 6 freq obs (2) - 1 freq nis (2) - 2 freq nus (2) - 5 freq ibs (2) - 3 freq nes (2) - 1 freq nls (2) - 6 freq nhs (2) - 38 freq nts (2) - 1 freq ncs (2) - 2 freq ons (3) - 1 freq cobs (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 - NBS nebs - 41 freq neebs - 13 freq knobs - 7 freq nobs - 3 freq neb's - 4 freq newbies - 1 freq nbs - 1 freq nibbies - 1 freq knobbies - 2 freq nebs' - 1 freq |
NBS |
| Time to execute Levenshtein function - 0.257416 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.464303 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.031058 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.043871 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.001004 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. |