| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| negator (0) - 6 freq negate (2) - 2 freq senator (2) - 2 freq negates (2) - 1 freq negation (2) - 2 freq negated (2) - 2 freq negatit (2) - 1 freq negatin (2) - 1 freq sentor (3) - 1 freq mediator (3) - 1 freq nagarr (3) - 2 freq sector (3) - 101 freq legat (3) - 1 freq eater (3) - 2 freq begat (3) - 2 freq bator (3) - 1 freq natir (3) - 1 freq narrator (3) - 29 freq orator (3) - 2 freq heater (3) - 13 freq eaton (3) - 1 freq nairator (3) - 1 freq debater (3) - 1 freq navigator (3) - 1 freq debtor (3) - 1 freq |
negator (0) - 6 freq negated (3) - 2 freq negatit (3) - 1 freq negation (3) - 2 freq negatin (3) - 1 freq negates (3) - 1 freq negate (3) - 2 freq negative (4) - 41 freq nairator (4) - 1 freq legaiter (4) - 1 freq navigator (4) - 1 freq nectar (4) - 9 freq natir (4) - 1 freq natur (4) - 24 freq netter (4) - 6 freq neuter (4) - 2 freq senator (4) - 2 freq nagarr (4) - 2 freq nurtur (5) - 1 freq enster (5) - 2 freq ngt (5) - 1 freq notour (5) - 5 freq onygate (5) - 1 freq nature (5) - 110 freq naettir (5) - 1 freq |
SoundEx code - N236 nocturne's - 1 freq nostrils - 20 freq nicht-air - 5 freq nosethirles - 1 freq nocturnal - 3 freq next-door - 2 freq nectar - 9 freq nostradamus - 2 freq neestdoor - 1 freq nastier - 1 freq nocturne - 2 freq nixtdoor - 1 freq nixt-dorr - 1 freq nasturtiums - 2 freq neesteran - 1 freq nightdress - 1 freq naist-door's - 1 freq negator - 6 freq nictheárlaich - 1 freq neist-door - 1 freq nicht-work - 1 freq nostre - 1 freq nostril - 1 freq nostril-flarin - 1 freq nicktroyftof - 2 freq nuxtarn - 1 freq nqtdrtgeqz - 1 freq |
MetaPhone code - NKTR nectar - 9 freq negator - 6 freq |
NEGATOR |
| Time to execute Levenshtein function - 0.221941 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.416941 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.028706 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.039431 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.001130 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. |