Triple
T14720950
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Probably Approximately Correct learning |
E345811
|
entity |
| Predicate | field |
P3
|
FINISHED |
| Object | computational learning theory |
E822917
|
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: computational learning theory | Statement: [Probably Approximately Correct learning, field, computational learning theory]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: computational learning theory Context triple: [Probably Approximately Correct learning, field, computational learning theory]
-
A.
Computational Learning Theory
chosen
Computational Learning Theory is a branch of computer science and mathematics that studies the design and analysis of algorithms that can learn patterns or functions from data, often using formal models of learning and complexity.
-
B.
Probably Approximately Correct learning (PAC learning)
Probably Approximately Correct (PAC) learning is a foundational framework in computational learning theory that formalizes what it means for an algorithm to efficiently learn a concept from examples with high probability and small error.
-
C.
LFD
LFD is the National Rail station code for Lingfield railway station in Surrey, England.
-
D.
Theoretical Computer Science
Theoretical Computer Science is a branch of computer science that focuses on mathematical and abstract foundations of computation, including algorithms, complexity, automata, and formal languages.
-
E.
Complexity Theory
Complexity Theory is a branch of theoretical computer science that studies the resources, such as time and space, required to solve computational problems and classifies these problems based on their inherent difficulty.
- 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_69d822e5911c8190ba589f957dbd9ba7 |
completed | April 9, 2026, 10:06 p.m. |
| NER | Named-entity recognition | batch_69dec25d56fc8190871873ca55d49272 |
completed | April 14, 2026, 10:40 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69fdf0957bb081908f1f382f3be8ec20 |
completed | May 8, 2026, 2:17 p.m. |
Created at: April 10, 2026, 1:29 a.m.