Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: Chernoff bound | Statement: [Chernoff information, relatedTo, Chernoff bound]

Target entity: Chernoff bound
Context triple: [Chernoff information, relatedTo, Chernoff bound]

• A. Chebyshev inequalities
  Chebyshev inequalities are probabilistic bounds that limit how much a random variable’s values can deviate from its mean in terms of its variance.
• B. Berry–Esseen theorem
  The Berry–Esseen theorem is a quantitative refinement of the central limit theorem that provides explicit bounds on the rate of convergence of normalized sums of independent random variables to the normal distribution.
• C. Chernoff information
  Chernoff information is a measure in information theory and statistics that quantifies the exponential rate at which the error probability decays when optimally distinguishing between two probability distributions.
• D. Barankin bound
  The Barankin bound is a fundamental lower bound in statistical estimation theory that generalizes and can be tighter than the Cramér–Rao bound for the variance of unbiased estimators, especially in non-regular or finite-sample settings.
• E. Cramér–Rao bound
  The Cramér–Rao bound is a fundamental result in statistical estimation theory that gives a lower limit on the variance of any unbiased estimator of a parameter, characterizing the best possible precision achievable.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: Chernoff bound
Triple: [Chernoff information, relatedTo, Chernoff bound]

The Chernoff bound is a probabilistic inequality that gives exponentially decreasing upper bounds on the tail probabilities of sums of independent random variables.

Target entity: Chernoff bound
Target entity description: The Chernoff bound is a probabilistic inequality that gives exponentially decreasing upper bounds on the tail probabilities of sums of independent random variables.

• A. Chebyshev inequalities
  Chebyshev inequalities are probabilistic bounds that limit how much a random variable’s values can deviate from its mean in terms of its variance.
• B. Berry–Esseen theorem
  The Berry–Esseen theorem is a quantitative refinement of the central limit theorem that provides explicit bounds on the rate of convergence of normalized sums of independent random variables to the normal distribution.
• C. Chernoff information
  Chernoff information is a measure in information theory and statistics that quantifies the exponential rate at which the error probability decays when optimally distinguishing between two probability distributions.
• D. Barankin bound
  The Barankin bound is a fundamental lower bound in statistical estimation theory that generalizes and can be tighter than the Cramér–Rao bound for the variance of unbiased estimators, especially in non-regular or finite-sample settings.
• E. Cramér–Rao bound
  The Cramér–Rao bound is a fundamental result in statistical estimation theory that gives a lower limit on the variance of any unbiased estimator of a parameter, characterizing the best possible precision achievable.
• F. None of above. chosen