Triple

T4416408
Position Surface form Disambiguated ID Type / Status
Subject Knuth–Morris–Pratt algorithm E94984 entity
Predicate comparedWith P278 FINISHED
Object Boyer–Moore algorithm E347189 NE FINISHED

How this triple was built (2 steps)

Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.

NER Named-entity recognition gpt-5-mini
Instruction
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).
Input
Phrase: Boyer–Moore algorithm | Statement: [Knuth–Morris–Pratt algorithm, comparedWith, Boyer–Moore algorithm]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Boyer–Moore algorithm
Context triple: [Knuth–Morris–Pratt algorithm, comparedWith, Boyer–Moore algorithm]
  • A. Boyer–Moore string-search algorithm chosen
    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.
  • B. 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.
  • C. 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.
  • D. 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.
  • 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.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

Provenance (3 batches)

The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.

Step Stage Batch ID Status When
creating Elicitation batch_69b3453a36908190b95a79a297ca083c completed March 12, 2026, 10:59 p.m.
NER Named-entity recognition batch_69b3551afb448190a2ce2000193808ac completed March 13, 2026, 12:06 a.m.
NED1 Entity disambiguation (via context triple) batch_69b5f61b56a8819099b5302f1b53f76d completed March 14, 2026, 11:58 p.m.
Created at: March 12, 2026, 11:29 p.m.