"Chapman-Robbins bound" meaning in English

See Chapman-Robbins bound in All languages combined, or Wiktionary

Noun

Forms: Chapman-Robbins bounds [plural]
Etymology: Named after Douglas Chapman and Herbert Robbins, who discovered it in 1951, independently of the original (1950) discovery by John Hammersley. Head templates: {{en-noun}} Chapman-Robbins bound (plural Chapman-Robbins bounds)
  1. (statistics) A lower bound on the variance of estimators of a deterministic parameter; a generalization of the Cramér-Rao bound, it is both tighter and more widely applicable, but usually harder to compute. Wikipedia link: Chapman-Robbins bound Categories (topical): Statistics Synonyms: Hammersley-Chapman-Robbins bound

Inflected forms

Download JSON data for Chapman-Robbins bound meaning in English (2.0kB)

{
  "etymology_text": "Named after Douglas Chapman and Herbert Robbins, who discovered it in 1951, independently of the original (1950) discovery by John Hammersley.",
  "forms": [
    {
      "form": "Chapman-Robbins bounds",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Chapman-Robbins bound (plural Chapman-Robbins bounds)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English entries with language name categories using raw markup",
          "parents": [
            "Entries with language name categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "parents": [
            "Terms with non-redundant non-automated sortkeys",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Statistics",
          "orig": "en:Statistics",
          "parents": [
            "Formal sciences",
            "Mathematics",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A lower bound on the variance of estimators of a deterministic parameter; a generalization of the Cramér-Rao bound, it is both tighter and more widely applicable, but usually harder to compute."
      ],
      "id": "en-Chapman-Robbins_bound-en-noun-bR157nL4",
      "links": [
        [
          "statistics",
          "statistics"
        ],
        [
          "variance",
          "variance"
        ],
        [
          "estimator",
          "estimator"
        ],
        [
          "deterministic",
          "deterministic"
        ],
        [
          "parameter",
          "parameter"
        ],
        [
          "generalization",
          "generalization"
        ],
        [
          "Cramér-Rao bound",
          "Cramér-Rao bound"
        ]
      ],
      "raw_glosses": [
        "(statistics) A lower bound on the variance of estimators of a deterministic parameter; a generalization of the Cramér-Rao bound, it is both tighter and more widely applicable, but usually harder to compute."
      ],
      "synonyms": [
        {
          "word": "Hammersley-Chapman-Robbins bound"
        }
      ],
      "topics": [
        "mathematics",
        "sciences",
        "statistics"
      ],
      "wikipedia": [
        "Chapman-Robbins bound"
      ]
    }
  ],
  "word": "Chapman-Robbins bound"
}
{
  "etymology_text": "Named after Douglas Chapman and Herbert Robbins, who discovered it in 1951, independently of the original (1950) discovery by John Hammersley.",
  "forms": [
    {
      "form": "Chapman-Robbins bounds",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Chapman-Robbins bound (plural Chapman-Robbins bounds)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English entries with language name categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with non-redundant non-automated sortkeys",
        "en:Statistics"
      ],
      "glosses": [
        "A lower bound on the variance of estimators of a deterministic parameter; a generalization of the Cramér-Rao bound, it is both tighter and more widely applicable, but usually harder to compute."
      ],
      "links": [
        [
          "statistics",
          "statistics"
        ],
        [
          "variance",
          "variance"
        ],
        [
          "estimator",
          "estimator"
        ],
        [
          "deterministic",
          "deterministic"
        ],
        [
          "parameter",
          "parameter"
        ],
        [
          "generalization",
          "generalization"
        ],
        [
          "Cramér-Rao bound",
          "Cramér-Rao bound"
        ]
      ],
      "raw_glosses": [
        "(statistics) A lower bound on the variance of estimators of a deterministic parameter; a generalization of the Cramér-Rao bound, it is both tighter and more widely applicable, but usually harder to compute."
      ],
      "synonyms": [
        {
          "word": "Hammersley-Chapman-Robbins bound"
        }
      ],
      "topics": [
        "mathematics",
        "sciences",
        "statistics"
      ],
      "wikipedia": [
        "Chapman-Robbins bound"
      ]
    }
  ],
  "word": "Chapman-Robbins bound"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-05 from the enwiktionary dump dated 2024-05-02 using wiktextract (f4fd8c9 and c9440ce). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.