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: Aho–Corasick algorithm | Statement: [Alfred V. Aho, notableConcept, Aho–Corasick algorithm]

Target entity: Aho–Corasick algorithm
Context triple: [Alfred V. Aho, notableConcept, Aho–Corasick 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. 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.
• C. Rabin–Karp algorithm
  The Rabin–Karp algorithm is a string-searching technique that uses hashing to efficiently find any one of a set of pattern strings in a text.
• D. 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.
• E. 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.
• 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: Aho–Corasick algorithm
Triple: [Alfred V. Aho, notableConcept, Aho–Corasick algorithm]

The Aho–Corasick algorithm is a classic string-searching algorithm that efficiently finds all occurrences of multiple patterns in a text using a trie-based finite-state machine.

Target entity: Aho–Corasick algorithm
Target entity description: The Aho–Corasick algorithm is a classic string-searching algorithm that efficiently finds all occurrences of multiple patterns in a text using a trie-based finite-state machine.

• 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. 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.
• C. Rabin–Karp algorithm
  The Rabin–Karp algorithm is a string-searching technique that uses hashing to efficiently find any one of a set of pattern strings in a text.
• D. 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.
• E. 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.
• F. None of above. chosen