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: Knuth–Morris–Pratt algorithm | Statement: [Donald E. Knuth, knownFor, Knuth–Morris–Pratt algorithm]

Target entity: Knuth–Morris–Pratt algorithm
Context triple: [Donald E. Knuth, knownFor, Knuth–Morris–Pratt algorithm]

• A. IAS machine
  The IAS machine was an early electronic stored-program computer designed by John von Neumann and his colleagues at the Institute for Advanced Study, serving as a prototype for many subsequent computer architectures.
• B. Look-and-say sequence
  The look-and-say sequence is a famous integer sequence where each term is generated by verbally describing the digits of the previous term, studied for its surprising combinatorial and growth properties.
• C. Introduction to Algorithms
  Introduction to Algorithms is a widely used, comprehensive textbook on algorithms and data structures, renowned for its rigorous yet accessible coverage of theoretical and practical topics in computer science.
• D. Turing machine
  A Turing machine is an abstract computational model that manipulates symbols on an infinite tape according to a set of rules, providing a formal foundation for the concept of algorithm and computability.
• E. Introduction to the Theory of Computation
  Introduction to the Theory of Computation is a widely used textbook in theoretical computer science that covers formal languages, automata, computability, and complexity theory.
• 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: Knuth–Morris–Pratt algorithm
Triple: [Donald E. Knuth, knownFor, Knuth–Morris–Pratt algorithm]

The Knuth–Morris–Pratt algorithm is a classic linear-time string-searching algorithm that efficiently finds occurrences of a pattern within a text by precomputing a prefix function to avoid redundant comparisons.

Target entity: Knuth–Morris–Pratt algorithm
Target entity description: The Knuth–Morris–Pratt algorithm is a classic linear-time string-searching algorithm that efficiently finds occurrences of a pattern within a text by precomputing a prefix function to avoid redundant comparisons.

• A. IAS machine
  The IAS machine was an early electronic stored-program computer designed by John von Neumann and his colleagues at the Institute for Advanced Study, serving as a prototype for many subsequent computer architectures.
• B. Look-and-say sequence
  The look-and-say sequence is a famous integer sequence where each term is generated by verbally describing the digits of the previous term, studied for its surprising combinatorial and growth properties.
• C. Introduction to Algorithms
  Introduction to Algorithms is a widely used, comprehensive textbook on algorithms and data structures, renowned for its rigorous yet accessible coverage of theoretical and practical topics in computer science.
• D. Turing machine
  A Turing machine is an abstract computational model that manipulates symbols on an infinite tape according to a set of rules, providing a formal foundation for the concept of algorithm and computability.
• E. Introduction to the Theory of Computation
  Introduction to the Theory of Computation is a widely used textbook in theoretical computer science that covers formal languages, automata, computability, and complexity theory.
• F. None of above. chosen