Triple
T2416884
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Max Dehn |
E52324
|
entity |
| Predicate | notableConcept |
P201
|
FINISHED |
| Object |
Dehn algorithm
The Dehn algorithm is a decision procedure in combinatorial group theory that solves the word problem for certain groups by systematically reducing words using defining relations.
|
E265416
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69ab495622948190bc6bc6e4cddaf645 |
elicitation | completed |
| NER | batch_69abc94eafd481909eeff689e5bf5960 |
ner | completed |
| NED1 | batch_69aebf4dcf6c8190a51f26af7e7a9b9c |
ned_source_triple | completed |
| NED2 | batch_69aec30f9ef481909b83f3cf9fd6e998 |
ned_description | completed |
| NEDg | batch_69aec2b3291c8190966344cd20963660 |
nedg | completed |
Created at: March 6, 2026, 9:42 p.m.