| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| positivity (0) - 6 freq positively (2) - 5 freq positivism (2) - 2 freq sensitivity (3) - 4 freq positive (3) - 88 freq posterity (3) - 8 freq positit (3) - 1 freq possibility (3) - 17 freq lpositivist (3) - 1 freq positives (3) - 7 freq positions (4) - 13 freq hospitality (4) - 13 freq insipidity (4) - 1 freq poshity (4) - 1 freq politician (4) - 11 freq productivity (4) - 2 freq fostirit (4) - 1 freq visibility (4) - 4 freq possibeility (4) - 1 freq positioned (4) - 5 freq activity (4) - 30 freq post-it (4) - 1 freq 'positive (4) - 1 freq creativity (4) - 9 freq captivity (4) - 1 freq |
positivity (0) - 6 freq positively (3) - 5 freq positit (4) - 1 freq posterity (4) - 8 freq positive (4) - 88 freq positivism (4) - 2 freq positives (4) - 7 freq post-it (5) - 1 freq postit (5) - 13 freq lpositivist (5) - 1 freq sensitivity (5) - 4 freq 'nativity (6) - 1 freq inactivity (6) - 1 freq nativity (6) - 4 freq captivity (6) - 1 freq position (6) - 95 freq creativity (6) - 9 freq postamt (6) - 1 freq positeeve (6) - 1 freq pastit (6) - 1 freq hosteility (6) - 1 freq negativity (6) - 7 freq positionin (6) - 1 freq positional (6) - 1 freq 'positive (6) - 1 freq |
SoundEx code - P231 postbag - 1 freq positive - 88 freq post-box - 1 freq positivity - 6 freq 'positive - 1 freq post-brexit - 2 freq postpone't - 1 freq pish-tha-beds - 1 freq positively - 5 freq pas-de-bas - 1 freq 'picked-up' - 1 freq pikstaff's - 1 freq positivism - 2 freq postponed - 2 freq post-franco - 1 freq positeeve - 1 freq passthepasty - 1 freq postbox - 3 freq poast-box - 1 freq poastbox - 1 freq postponement - 1 freq positives - 7 freq pcgqduf - 1 freq positivementalattitude - 1 freq pestopublic - 1 freq pocket-book - 1 freq pqdprc - 1 freq postpone - 1 freq |
MetaPhone code - PSTFT positivity - 6 freq |
POSITIVITY |
| Time to execute Levenshtein function - 0.204246 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.378109 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.027045 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.036825 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.000779 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. |