Triple
T2268046
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Andrew Viterbi |
E50192
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Viterbi algorithm
The Viterbi algorithm is a dynamic programming method used to find the most likely sequence of hidden states in probabilistic models such as Hidden Markov Models, widely applied in fields like digital communications, speech recognition, and bioinformatics.
|
E252270
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69a88b01e0048190ba96431b5f990ba9 |
elicitation | completed |
| NER | batch_69abc1bbb49c8190822c7d809375e879 |
ner | completed |
| NED1 | batch_69ae7f0bb4d08190b7fa8815d691bdbb |
ned_source_triple | completed |
| NED2 | batch_69ae802d03648190a71303daf20e6162 |
ned_description | completed |
| NEDg | batch_69ae7fc194488190bb71124f0225a521 |
nedg | completed |
Created at: March 4, 2026, 7:48 p.m.