Triple
T17995425
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | 2005 Polish parliamentary election |
E430487
|
entity |
| Predicate | usedSeatAllocationMethod |
P47248
|
FINISHED |
| Object | D’Hondt method |
—
|
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: D’Hondt method | Statement: [2005 Polish parliamentary election, usedSeatAllocationMethod, D’Hondt method]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: D’Hondt method Context triple: [2005 Polish parliamentary election, usedSeatAllocationMethod, D’Hondt method]
-
A.
d’Hondt method
chosen
The d’Hondt method is a highest-averages formula used in proportional representation systems to allocate seats or posts among parties based on their share of the vote.
-
B.
Sainte-Laguë method
The Sainte-Laguë method is a highest-averages system of party-list proportional representation that allocates seats more evenly between large and small parties than the d’Hondt method.
-
C.
Droop quota
The Droop quota is a mathematical threshold used in proportional representation elections to determine the minimum number of votes a candidate needs to be elected.
-
D.
largest remainder method
The largest remainder method is a proportional representation electoral system that allocates seats by first assigning them according to full quotas of votes and then distributing remaining seats based on the largest leftover vote totals.
-
E.
Borda count
The Borda count is a ranked voting method in which voters order candidates and points are assigned based on position in each ranking, with the candidate having the highest total score winning.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: usedSeatAllocationMethod Context triple: [2005 Polish parliamentary election, usedSeatAllocationMethod, D’Hondt method]
-
A.
seatsAreAllocatedTo
Indicates that specific seats are assigned or designated to particular entities (such as people, groups, or bookings).
-
B.
hasSeatAllocation
Indicates that an entity has been assigned a specific seat or set of seats within a defined seating arrangement or capacity.
-
C.
seatsAllocatedBy
chosen
Indicates that seats are assigned or distributed by a particular agent, authority, or mechanism.
-
D.
seatAllocationLevel
Indicates the degree or priority level at which seats are assigned or distributed among eligible entities.
-
E.
seatSelectionPolicy
Indicates the rules or constraints governing how seats are chosen or assigned in a given context.
- F. None of above.
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_69d8b90364248190a37381adea932f42 |
completed | April 10, 2026, 8:46 a.m. |
| NER | Named-entity recognition | batch_69e4b3e3b060819086855bc01aceb42a |
completed | April 19, 2026, 10:52 a.m. |
| PD | Predicate disambiguation | batch_69e3f90039e4819080527f860dca042e |
completed | April 18, 2026, 9:34 p.m. |
Created at: April 10, 2026, 10:23 a.m.