Triple
T636099
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Edsger W. Dijkstra |
E16624
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object |
shunting-yard algorithm
The shunting-yard algorithm is a method for parsing mathematical expressions and converting infix notation to postfix (or prefix) form using a stack-based procedure.
|
E79783
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69a4936be1c88190af56540324b57da7 |
elicitation | completed |
| NER | batch_69a49ee667f08190a0332b8f6c569e1a |
ner | completed |
| NED1 | batch_69a56ef25ffc81908517310fe0c84a68 |
ned_source_triple | completed |
| NED2 | batch_69a5733acb188190b4cdd12ed3a96860 |
ned_description | completed |
| NEDg | batch_69a56f5668108190910db85f3beb5eed |
nedg | completed |
Created at: March 1, 2026, 7:35 p.m.