Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
non-pc (0) - 1 freq non-pe (1) - 1 freq non- (2) - 1 freq none (3) - 57 freq noo- (3) - 1 freq nonces (3) - 2 freq sonic (3) - 6 freq nono (3) - 1 freq con- (3) - 3 freq nordic (3) - 9 freq ionic (3) - 2 freq monic (3) - 1 freq nondum (3) - 1 freq opc (3) - 1 freq on- (3) - 3 freq nop (3) - 1 freq noup (3) - 2 freq tonic (3) - 13 freq onic (3) - 1 freq now-at (3) - 1 freq noncey (3) - 1 freq nou-- (3) - 1 freq rojpc (3) - 1 freq onc (3) - 1 freq nou- (3) - 1 freq |
non-pc (0) - 1 freq non-pe (2) - 1 freq non-paid (4) - 1 freq non- (4) - 1 freq nnpw (5) - 1 freq noncey (5) - 1 freq neon- (5) - 1 freq nopiece (6) - 2 freq nowp (6) - 1 freq nops (6) - 1 freq ontac (6) - 2 freq noop (6) - 1 freq conc (6) - 1 freq zpnpc (6) - 1 freq on-it (6) - 2 freq inpic (6) - 1 freq noo-a (6) - 2 freq no-wyce (6) - 2 freq nancie (6) - 3 freq nancy (6) - 37 freq rin-up (6) - 2 freq nano- (6) - 1 freq nonsence (6) - 1 freq annec (6) - 3 freq nae-pea (6) - 1 freq |
SoundEx code - N512 nimbus - 1 freq nymphs - 4 freq non-fiction - 4 freq nanophase - 1 freq non-pc - 1 freq nimbyism - 2 freq |
MetaPhone code - NNPK non-pc - 1 freq |
NON-PC |
Time to execute Levenshtein function - 0.223735 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.398828 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.028821 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.038273 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.000981 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. |