Triple
T17568110
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | BurntSushi |
E427868
|
entity |
| Predicate | software |
P10387
|
FINISHED |
| Object | Rust aho-corasick crate |
—
|
NE NERFINISHED |
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: Rust aho-corasick crate | Statement: [BurntSushi, software, Rust aho-corasick crate]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Rust aho-corasick crate Context triple: [BurntSushi, software, Rust aho-corasick crate]
-
A.
Aho–Corasick algorithm
chosen
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.
-
B.
Rabin automaton
A Rabin automaton is a type of ω-automaton used in formal verification and automata theory to recognize sets of infinite sequences via Rabin acceptance conditions.
-
C.
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.
-
D.
Rust regex crate
The Rust regex crate is a popular Rust library that provides fast, safe, and feature-rich regular expression support without relying on backtracking.
-
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.
Provenance (2 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_69d889e0385081908a04b66f4dd4bd0d |
completed | April 10, 2026, 5:25 a.m. |
| NER | Named-entity recognition | batch_69e4592e56e481909249b831cecc31d5 |
completed | April 19, 2026, 4:25 a.m. |
Created at: April 10, 2026, 5:50 a.m.