Triple
T18386714
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | SV Darmstadt 98 |
E446610
|
entity |
| Predicate | abbreviation |
P43
|
FINISHED |
| Object | SVD |
—
|
NE NERFINISHED |
How this triple was built (3 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: SVD | Statement: [SV Darmstadt 98, abbreviation, SVD]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: SVD Context triple: [SV Darmstadt 98, abbreviation, SVD]
-
A.
SVD
SVD is the IATA airport code for Argyle International Airport, the main international gateway to Saint Vincent and the Grenadines in the Caribbean.
-
B.
SVD
SVD is the abbreviation for the Special Victims Division, a specialized police unit that investigates sensitive crimes such as sexual offenses and crimes against vulnerable victims.
-
C.
Singular value decomposition
Singular value decomposition is a fundamental matrix factorization technique that expresses a matrix as the product of two orthogonal (or unitary) matrices and a diagonal matrix of singular values, widely used in numerical analysis, data compression, and dimensionality reduction.
-
D.
Golub–Kahan SVD algorithm
The Golub–Kahan SVD algorithm is a numerical method for computing the singular value decomposition of a matrix by first reducing it to bidiagonal form and then iteratively refining its singular values and vectors.
-
E.
sva
sva is the ISO 639-3 code for the Svan language, a Kartvelian language spoken by the Svan people in the Svaneti region of northwestern Georgia.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: SVD Target entity description: SVD is the common abbreviation for SV Darmstadt 98, a German professional football club based in Darmstadt, Hesse.
-
A.
SVD
SVD is the abbreviation for the Special Victims Division, a specialized police unit that investigates sensitive crimes such as sexual offenses and crimes against vulnerable victims.
-
B.
SVD
SVD is the IATA airport code for Argyle International Airport, the main international gateway to Saint Vincent and the Grenadines in the Caribbean.
-
C.
Singular value decomposition
Singular value decomposition is a fundamental matrix factorization technique that expresses a matrix as the product of two orthogonal (or unitary) matrices and a diagonal matrix of singular values, widely used in numerical analysis, data compression, and dimensionality reduction.
-
D.
Golub–Kahan SVD algorithm
The Golub–Kahan SVD algorithm is a numerical method for computing the singular value decomposition of a matrix by first reducing it to bidiagonal form and then iteratively refining its singular values and vectors.
-
E.
sva
sva is the ISO 639-3 code for the Svan language, a Kartvelian language spoken by the Svan people in the Svaneti region of northwestern Georgia.
- F. None of above. chosen
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_69d8b9f370b88190b1e5081c2c238e7f |
completed | April 10, 2026, 8:50 a.m. |
| NER | Named-entity recognition | batch_69e517a00c608190a8f0010c7b53df90 |
completed | April 19, 2026, 5:57 p.m. |
Created at: April 10, 2026, 10:46 a.m.