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: [Boyer–Moore string-search algorithm, comparedWith, Knuth–Morris–Pratt algorithm]

Target entity: Knuth–Morris–Pratt algorithm
Context triple: [Boyer–Moore string-search algorithm, comparedWith, Knuth–Morris–Pratt algorithm]

• A. Knuth–Morris–Pratt algorithm chosen
  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. 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.
• C. 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.
• D. 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.
• E. 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.
• F. None of above.
• G. Unsure - the case is ambiguous/there is not enough information to decide.