| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| negotiates (0) - 1 freq negotiate (1) - 6 freq negotiated (1) - 2 freq negotiatit (2) - 2 freq negotiatin (2) - 2 freq negotiators (2) - 1 freq negatives (3) - 3 freq negotiations (3) - 6 freq negotiation (3) - 1 freq negates (3) - 1 freq notices (4) - 16 freq negative (4) - 41 freq rotates (4) - 2 freq retaliates (4) - 2 freq estimates (4) - 1 freq estates (4) - 19 freq nomintes (4) - 1 freq associates (4) - 4 freq negate (4) - 2 freq mediates (4) - 1 freq legitimate (4) - 9 freq nepotistic (4) - 1 freq noties (4) - 2 freq negotioations (4) - 1 freq negatit (4) - 1 freq |
negotiates (0) - 1 freq negotiated (2) - 2 freq negotiate (2) - 6 freq negotiatin (3) - 2 freq negotiators (3) - 1 freq negotiatit (3) - 2 freq negates (4) - 1 freq negotiation (4) - 1 freq negotiations (4) - 6 freq negatives (4) - 3 freq negotioations (5) - 1 freq negatit (5) - 1 freq rotates (6) - 2 freq hesitates (6) - 1 freq oniegates (6) - 15 freq negated (6) - 2 freq eemitates (6) - 1 freq noughties (6) - 1 freq naegaits (6) - 5 freq entities (6) - 15 freq nutties (6) - 1 freq regattas (6) - 1 freq meditates (6) - 2 freq neckties (6) - 1 freq notts (6) - 20 freq |
SoundEx code - N233 negotiates - 1 freq nceded - 1 freq nestit - 3 freq nicht-watchie - 1 freq negotiate - 6 freq negotiations - 6 freq negotiated - 2 freq nested - 1 freq nyght'at - 1 freq negated - 2 freq noosted - 1 freq nicht-at-eenie - 2 freq new-cutted - 2 freq nochtwithstaundin - 1 freq negotiatit - 2 freq negotiation - 1 freq nicht-it - 1 freq negotioations - 1 freq €˜negotiations - 1 freq negotiatin - 2 freq negatit - 1 freq newstatesman - 4 freq negotiators - 1 freq nesstotties - 1 freq |
MetaPhone code - NKXTS negotiates - 1 freq |
NEGOTIATES |
| Time to execute Levenshtein function - 0.689439 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 - 1.107933 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.103057 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.109209 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.000957 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. |