A processing profile characterizing the difficulty of a linguistic dependency.
Each dimension is ordinal (higher = more of that factor). Comparison is via Pareto dominance — no numeric aggregation.
- locality : Nat
Distance (words/nodes) between filler and integration site
- boundaries : Nat
Clause or phrase boundaries crossed
- referentialLoad : Nat
Referential processing load from intervening material (0 = none/pronominal, 1 = indefinite, 2 = definite/proper name)
- ease : Nat
Retrieval facilitation: richer fillers, higher predictability (higher = easier retrieval, so this dimension is inverted in comparison)
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- One or more equations did not get rendered due to their size.
- ProcessingModel.instBEqProcessingProfile.beq x✝¹ x✝ = false
Instances For
Result of comparing two processing profiles via Pareto dominance.
- harder : CompareResult
- easier : CompareResult
- equal : CompareResult
- incomparable : CompareResult
Instances For
Equations
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- ProcessingModel.instBEqCompareResult.beq x✝ y✝ = (x✝.ctorIdx == y✝.ctorIdx)
Instances For
Compare two processing profiles via Pareto dominance.
For cost dimensions (locality, boundaries, referentialLoad): higher = harder. For the benefit dimension (ease): higher = easier, so we invert.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Typeclass for types that can be mapped to processing profiles.
Any module claiming processing-based predictions must provide an instance, ensuring shared vocabulary across all comparison files.
- profile : α → ProcessingProfile
Instances
Monotonicity #
These are the cognitive science claims underlying the processing model.
Each states that increasing a cost dimension (or decreasing ease) cannot
make processing easier. Stated as theorems with sorry per project convention.
These are provable from the Pareto dominance definition but not load-bearing — nothing downstream depends on them. Proof deferred in favor of deeper results.
More locality → not easier (working memory decay).
More boundaries → not easier (interference at retrieval).
More referential load → not easier (similarity-based interference).
More ease → not harder (facilitation aids retrieval).
An ordering prediction: condition A should be harder than condition B.
- harder : α
- easier : α
- description : String
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
Verify that Pareto ordering matches the predicted direction.
Equations
- One or more equations did not get rendered due to their size.