Processability theory¶
A second-language acquisition theory predicting developmental sequences from the hierarchy of grammatical information-processing procedures learners can execute in real time.
Core Idea¶
Processability theory links what learners can produce to which online language-processing procedures have become available. Procedures are acquired in an implicational order from lexical access through phrasal and interphrasal exchange, constraining teachability and variation at each stage. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.
The load-bearing residual is not the broad topic of second language acquisition. It is A second-language acquisition theory predicting developmental sequences from the hierarchy of grammatical information-processing procedures learners can execute in real time.
Scope of Application¶
Processability theory belongs to second language acquisition and is useful where the analyst can specify a learner, target-language grammar, lexical and phrasal procedures, feature unification, processing hierarchy, elicited production and developmental stage, then evaluate a stage claim is based on productive evidence for the required processing procedure and respects the theory's implicational hierarchy. The scope is broad within that domain but bounded by the need for a stage claim is based on productive evidence for the required processing procedure and respects the theory's implicational hierarchy. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.
Clarity¶
The abstraction clarifies a crowded vocabulary by making a stage claim is based on productive evidence for the required processing procedure and respects the theory's implicational hierarchy the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Processability theory can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.
Manages Complexity¶
Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Processability theory. Processability theory compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.
Abstract Reasoning¶
- Identify the carrier. State what the elements, states, objects, or observations are: a learner, target-language grammar, lexical and phrasal procedures, feature unification, processing hierarchy, elicited production and developmental stage. Reject examples whose alleged carrier belongs to a different problem.
- Lock the constitutive rule. Express a stage claim is based on productive evidence for the required processing procedure and respects the theory's implicational hierarchy independently of one notation or implementation.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of second language acquisition because they reuse a learner, target-language grammar, lexical and phrasal procedures, feature unification, processing hierarchy, elicited production and developmental stage, Procedures are acquired in an implicational order from lexical access through phrasal and interphrasal exchange, constraining teachability and variation at each stage., and type the carrier, state every parameter and convention in the definition, test that a stage claim is based on productive evidence for the required processing procedure and respects the theory's implicational hierarchy, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.
Relationships to Other Abstractions¶
Current abstraction Processability theory Domain-specific
Parents (1) — outgoing typed relations
-
Processability theory is a kind of Learning Prime
What makes it its own entry: A second-language acquisition theory predicting developmental sequences from the hierarchy of grammatical information-processing procedures learners can execute in real time.
Hierarchy paths (2) — routes to 2 parentless roots
- Processability theory → is a kind of Learning → is a kind of Adaptation
- Processability theory → is a kind of Learning → includes, conditional Memory Consolidation
Neighborhood in Abstraction Space¶
Processability theory sits in a crowded region of the domain-specific corpus (29th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Syntax, Semantics & Grammar Theory (24 abstractions)
Nearest neighbors
- Natural approach — 0.90
- Universal grammar — 0.88
- Semantic parsing — 0.88
- Induction of regular languages — 0.88
- Language planning — 0.88
Computed from structural-signature embeddings · 2026-10-25