Triple
T3305993
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | J Strother Moore |
E69450
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object |
Boyer–Moore string-search algorithm
The Boyer–Moore string-search algorithm is a highly efficient pattern-matching algorithm that scans text from right to left and uses precomputed shift rules to skip sections of the text, making it one of the fastest practical algorithms for substring search.
|
E347189
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69ad859f218081909458d2cebbf57565 |
elicitation | completed |
| NER | batch_69adb0c9470881908c36c1984fdbb67b |
ner | completed |
| NED1 | batch_69b2f3e6e55881909417d54e0d8f0a26 |
ned_source_triple | completed |
| NED2 | batch_69b312b6e224819080957998acbed524 |
ned_description | completed |
| NEDg | batch_69b2fa93ebc0819084c4cdfdb8d6e48d |
nedg | completed |
Created at: March 8, 2026, 3:11 p.m.