Triple
T14773339
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Boyer–Moore string-search algorithm |
E347189
|
entity |
| Predicate | influenced |
P9
|
FINISHED |
| Object |
Apostolico–Giancarlo algorithm
The Apostolico–Giancarlo algorithm is an efficient string-search algorithm that refines and extends Boyer–Moore–style techniques to achieve fast pattern matching, particularly in worst-case scenarios.
|
E1119492
|
NE FINISHED |
How this triple was built (4 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: Apostolico–Giancarlo algorithm | Statement: [Boyer–Moore string-search algorithm, influenced, Apostolico–Giancarlo algorithm]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Apostolico–Giancarlo algorithm Context triple: [Boyer–Moore string-search algorithm, influenced, Apostolico–Giancarlo algorithm]
-
A.
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.
-
B.
Benettin algorithm
The Benettin algorithm is a numerical method used in dynamical systems theory to estimate Lyapunov exponents, which quantify the rate of separation of nearby trajectories and indicate chaos.
-
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.
Warnock algorithm
The Warnock algorithm is a classic hidden surface determination technique in computer graphics that recursively subdivides a scene into smaller regions to efficiently resolve visibility.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
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]"
Input
Entity: Apostolico–Giancarlo algorithm Triple: [Boyer–Moore string-search algorithm, influenced, Apostolico–Giancarlo algorithm]
Generated description
The Apostolico–Giancarlo algorithm is an efficient string-search algorithm that refines and extends Boyer–Moore–style techniques to achieve fast pattern matching, particularly in worst-case scenarios.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Apostolico–Giancarlo algorithm Target entity description: The Apostolico–Giancarlo algorithm is an efficient string-search algorithm that refines and extends Boyer–Moore–style techniques to achieve fast pattern matching, particularly in worst-case scenarios.
-
A.
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.
-
B.
Benettin algorithm
The Benettin algorithm is a numerical method used in dynamical systems theory to estimate Lyapunov exponents, which quantify the rate of separation of nearby trajectories and indicate chaos.
-
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.
Warnock algorithm
The Warnock algorithm is a classic hidden surface determination technique in computer graphics that recursively subdivides a scene into smaller regions to efficiently resolve visibility.
- F. None of above. chosen
Provenance (5 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_69d822e9b9e08190bedcc31a163fda82 |
completed | April 9, 2026, 10:06 p.m. |
| NER | Named-entity recognition | batch_69dec81485e08190be35baafcf22b6f2 |
completed | April 14, 2026, 11:04 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69fe0cfd26fc81909fba39c8705437ed |
completed | May 8, 2026, 4:19 p.m. |
| NEDg | Description generation | batch_69fe17fc37ec8190b2e9c786a5e7843e |
completed | May 8, 2026, 5:06 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69fe18786294819080ce5ee0d8af00c9 |
completed | May 8, 2026, 5:08 p.m. |
Created at: April 10, 2026, 1:31 a.m.