Each row expands the stages above it. Segment widths show their share of the parent time; colours distinguish branches and depth.
Packet work149.15s
Prepare packet0.18s
Resolve current engine0.00s
Fetch latest Simplify main0.00s
Resolve selected commit0.00s
Check / refresh corpus index0.00s
Read corpus identity0.04s
Resolve previous engine0.02s
Fingerprint current grammar and parser0.00s
Fingerprint previous grammar and parser0.00s
Fingerprint visualizer pipeline0.04s
Check static-page renderer0.02s
Choose packet / resume position0.02s
Other preparation0.03s
KPI refresh148.43s
Prepare pinned engine0.01s
Check out required engine files0.00s
Link runtime data0.00s
Other snapshot preparation0.01s
Prepare worker0.12s
Identify engine and runtime0.07s
Retire previous worker0.00s
Remove previous engine snapshot0.00s
Write worker request0.02s
Model initialization0.00s
Other worker preparation0.02s
Compute KPIs and artifacts147.82s
Select sentences0.05s
Measure new patterns2.93s
Check whether these sentences were already counted0.00s
Check indexed sentence records · read 0 bytes · host I/O stall some 0 ms, full 0 ms0.00s
Open acquisition ledger0.00s
Read ledger schema0.00s
Close acquisition ledger0.00s
Parse uncached sentences2.69s
Colouring and hypertrie143.13s
Prepare corpus input0.00s
Load Simplify modules0.00s
Set up sentence replay0.00s
Replay corpus sentences133.02s
Simplify130.45s
Coreference2.84s
Preprocess coreference2.84s
Preprocess and lineage0.13s
Preprocess layout and lineage0.13s
Tree++ and rule processing30.47s
Prime parser and build forests2.66s
A · Expand input0.01s
A · Build document packets0.00s
B · Apply rules / normalize27.66s
C · Join output surfaces0.00s
D · Build annotation cache0.14s
Build and emit output70.11s
Render simplified text0.01s
Build output annotations and Tree++ structure · after first: median 64–128 ms, p95 256–512 ms · slowest sentence #485: 1,759 ms (16 words, 94 characters) · tell-me-a-story-ccby-2024:L761870.11s
Produce semantic payload · after first: median 64–128 ms, p95 256–512 ms · slowest sentence #232: 1,671 ms (15 words, 74 characters) · 1001-stories-cc0-2026:L53558.68s
Legacy annotation assembly9.99s
Build WordNet profile0.22s
Apply authored-marker overlay0.05s
Build document units6.96s
Run final annotation passes2.72s
Other legacy annotation work0.03s
Other semantic production48.69s
Build typed document0.95s
Post-assembly10.47s
Complete annotation envelope0.01s
Other / not yet broken down26.90s
Convert annotations to JSON2.37s
Visualizer bookkeeping0.04s
Count closed words0.03s
Attribute rule activity0.00s
Merge clauses and relations0.00s
Build output clauses0.01s
Other sentence replay work0.16s
Prepare replay output0.00s
Write annotations0.29s
Prepare Hypertrie input1.53s
Hypertrie8.23s
Parse output clauses1.31s
Build trees and slices2.06s
Finish Rust aggregation1.38s
Compact and write indexes1.74s
Other hypertrie work0.01s
Worker overhead outside measured trie work1.74s
Setup before trie work0.10s
Worker dispatch / wrapper overhead1.64s
Validate Hypertrie output0.01s
Publish graph artifacts0.05s
Check rule ownership0.00s
Unattributed coverage time0.00s
Measure rule activity0.01s
Update shape ledger0.00s
Measure rule-message context0.00s
Load enabled-rule inventory0.00s
Inspect rule-work queues0.00s
Compare full-corpus progress0.00s
Compare ready-to-test rules0.00s
Other KPI work1.71s
Publish latest KPI and manifest0.43s
Check KPI output is complete0.04s
Validate Hypertrie index0.06s
Audit rule ownership0.00s
Confirm engine stayed consistent0.01s
Write run manifest0.23s
Publish verified files · host I/O pressure during publish: some 0.000s, full 0.000s0.08s
First parse call: 0.62s; included in the steady rate.
Hypertrie aggregation: Rust backend · 1 disk shards
Enabled-rule inventory: reused the worker's in-memory inventory
Enabled-rule inventory parser: not used (process cache hit)
SpaCy parser timer: 2.21s (diagnostic; overlaps the engine phases above and is not added again)
Simplify phases are summed across this packet. The listed top-level engine phases are additive; some diagnostic subtimers overlap them and are intentionally omitted. Tree++ relation-only time is not measured separately.