| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| negative (0) - 41 freq negatives (1) - 3 freq €˜negative (2) - 1 freq negatin (2) - 2 freq relative (2) - 29 freq negatively (2) - 2 freq native (2) - 94 freq negate (2) - 2 freq negatit (2) - 1 freq sedative (2) - 1 freq negation (2) - 2 freq negates (3) - 1 freq gaive (3) - 1 freq raelative (3) - 1 freq restive (3) - 1 freq evasive (3) - 1 freq gelatine (3) - 2 freq vegetative (3) - 2 freq vocative (3) - 1 freq fugitive (3) - 3 freq rh-negative (3) - 1 freq emotive (3) - 3 freq negator (3) - 6 freq normative (3) - 1 freq narrative (3) - 41 freq |
negative (0) - 41 freq negatives (2) - 3 freq negate (3) - 2 freq native (3) - 94 freq negatit (3) - 1 freq negation (3) - 2 freq negatin (3) - 2 freq negatively (3) - 2 freq negated (4) - 2 freq negitively (4) - 1 freq fugitive (4) - 3 freq negotiate (4) - 6 freq nairative (4) - 3 freq intiative (4) - 1 freq €˜negative (4) - 1 freq sedative (4) - 1 freq relative (4) - 29 freq negator (4) - 6 freq negates (4) - 1 freq negativity (4) - 7 freq nestie (5) - 7 freq nightie (5) - 1 freq creative (5) - 102 freq neave (5) - 3 freq gatie (5) - 1 freq |
SoundEx code - N231 nichtfaw - 2 freq nosedive - 1 freq negatively - 2 freq negativity - 7 freq nest-feitherin - 1 freq nest-featherin - 1 freq negative - 41 freq nocht-fiction - 3 freq nochtfiction - 1 freq nicht-flittins - 1 freq nichtfa - 2 freq nicht-faa - 1 freq 'nichtfa' - 1 freq €˜negative - 1 freq nichtbour - 2 freq nest-biggin - 1 freq negatives - 3 freq negitively - 1 freq nichtfaa - 2 freq neuk-o-the-back - 1 freq negativitiy's - 1 freq nickstoppani - 9 freq nsyutdyp - 1 freq nhsthebrave - 1 freq nctpehgy - 1 freq nyqtf - 1 freq |
MetaPhone code - NKTF negative - 41 freq €˜negative - 1 freq knocked-aff - 1 freq nyqtf - 1 freq |
NEGATIVE |
| Time to execute Levenshtein function - 0.193927 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.373972 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.027679 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.037372 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.000934 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. |