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: Hopcroft–Karp algorithm | Statement: [John E. Hopcroft, knownFor, Hopcroft–Karp algorithm]

Target entity: Hopcroft–Karp algorithm
Context triple: [John E. Hopcroft, knownFor, Hopcroft–Karp algorithm]

• A. Gale–Shapley algorithm
  The Gale–Shapley algorithm is a foundational procedure in mathematics and computer science that computes stable matchings between two equally sized sets, such as students and schools or men and women in the stable marriage problem.
• B. Fleury's algorithm
  Fleury's algorithm is a classical graph-theoretic procedure for systematically finding an Eulerian trail by repeatedly choosing edges that are not bridges unless necessary.
• C. Kruskal’s minimum spanning tree algorithm
  Kruskal’s minimum spanning tree algorithm is a classic greedy graph algorithm that builds a minimum spanning tree by repeatedly adding the smallest-weight edge that does not create a cycle, typically implemented efficiently using a union–find data structure.
• D. Cristian's algorithm
  Cristian's algorithm is a clock synchronization method in distributed systems that estimates accurate time on client machines by querying a time server and adjusting for message delays.
• E. Bellman–Ford algorithm
  The Bellman–Ford algorithm is a graph shortest-path algorithm that can handle negative edge weights and detect negative cycles, often used in routing and network optimization.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Hopcroft–Karp algorithm
Target entity description: The Hopcroft–Karp algorithm is a classic efficient algorithm in computer science for finding maximum matchings in bipartite graphs.

• A. Gale–Shapley algorithm
  The Gale–Shapley algorithm is a foundational procedure in mathematics and computer science that computes stable matchings between two equally sized sets, such as students and schools or men and women in the stable marriage problem.
• B. Fleury's algorithm
  Fleury's algorithm is a classical graph-theoretic procedure for systematically finding an Eulerian trail by repeatedly choosing edges that are not bridges unless necessary.
• C. Kruskal’s minimum spanning tree algorithm
  Kruskal’s minimum spanning tree algorithm is a classic greedy graph algorithm that builds a minimum spanning tree by repeatedly adding the smallest-weight edge that does not create a cycle, typically implemented efficiently using a union–find data structure.
• D. Cristian's algorithm
  Cristian's algorithm is a clock synchronization method in distributed systems that estimates accurate time on client machines by querying a time server and adjusting for message delays.
• E. Bellman–Ford algorithm
  The Bellman–Ford algorithm is a graph shortest-path algorithm that can handle negative edge weights and detect negative cycles, often used in routing and network optimization.
• F. None of above. chosen