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: Boyer–Moore string-search algorithm | Statement: [J Strother Moore, knownFor, Boyer–Moore string-search algorithm]

Target entity: Boyer–Moore string-search algorithm
Context triple: [J Strother Moore, knownFor, Boyer–Moore string-search algorithm]

• A. 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.
• B. Thompson's algorithm for regular expression matching
  Thompson's algorithm for regular expression matching is a classic method that converts regular expressions into nondeterministic finite automata (NFAs) to enable efficient pattern matching in text processing.
• C. Marzullo's algorithm
  Marzullo's algorithm is a method for selecting the most likely correct time interval from multiple, possibly conflicting time sources, commonly used in clock synchronization systems.
• D. Thompson's algorithm
  Thompson's algorithm is a classic computer science method for converting regular expressions into nondeterministic finite automata (NFAs), widely used in pattern matching and lexical analysis.
• E. Regular Expression Search Algorithm
  Regular Expression Search Algorithm is a pattern-matching method for efficiently finding text strings that match specified regular expressions, originally developed and formalized by computer scientist Ken Thompson.
• 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: Boyer–Moore string-search algorithm
Triple: [J Strother Moore, knownFor, Boyer–Moore string-search algorithm]

The Boyer–Moore string-search algorithm is a highly efficient pattern-matching algorithm that scans text from right to left and uses precomputed shift rules to skip sections of the text, making it one of the fastest practical algorithms for substring search.

Target entity: Boyer–Moore string-search algorithm
Target entity description: The Boyer–Moore string-search algorithm is a highly efficient pattern-matching algorithm that scans text from right to left and uses precomputed shift rules to skip sections of the text, making it one of the fastest practical algorithms for substring search.

• A. 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.
• B. Thompson's algorithm for regular expression matching
  Thompson's algorithm for regular expression matching is a classic method that converts regular expressions into nondeterministic finite automata (NFAs) to enable efficient pattern matching in text processing.
• C. Marzullo's algorithm
  Marzullo's algorithm is a method for selecting the most likely correct time interval from multiple, possibly conflicting time sources, commonly used in clock synchronization systems.
• D. Thompson's algorithm
  Thompson's algorithm is a classic computer science method for converting regular expressions into nondeterministic finite automata (NFAs), widely used in pattern matching and lexical analysis.
• E. Regular Expression Search Algorithm
  Regular Expression Search Algorithm is a pattern-matching method for efficiently finding text strings that match specified regular expressions, originally developed and formalized by computer scientist Ken Thompson.
• F. None of above. chosen