Radical Indexing Method
Updated 2026-08-22
INTRODUCTION
English translation pending.
CORE DEFINITION
Radical indexing classifies Chinese characters by their radical, the component that usually carries a semantic hint, and then orders characters within each radical by the number of additional strokes. The system was standardized in early dictionaries and fixed at two hundred and fourteen radicals in the Kangxi Dictionary of 1716. The core claim is that a salient shared feature can serve as a stable index key even when the items have no natural linear order. The qualification is that radical assignment is conventional rather than derivable, so a character's radical sometimes has to be learned.
SCAFFOLDING EFFECT
Reduce cognitive load
- Key selection: choose one salient, stable attribute shared by your items to index by. - Hierarchical lookup: nest a second ordering inside each group so search stays fast. - Convention check: document the index keys explicitly, since users cannot reliably infer them from the items.
Anchor fast decisions
Search cost falls when a user can narrow the candidate set by a property that is immediately visible and roughly evenly distributed. A radical does this for characters, and stroke count orders the remainder so the final scan is short. The design generalizes to any collection: pick one visible key to partition, then a secondary key that is cheap to compare, and the search space shrinks at every level.
MINIMUM ACTION
In progress 0/1Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- zh.wikipedia.orghttps://zh.wikipedia.org/wiki/%E8%AF%B4%E6%96%87%E8%A7%A3%E5%AD%97verified
PRIVATE NOTES · Only visible to you
SAVED Q&A
ENTRY Q&A · Private saving available
Ask with a clear boundary
thinkingmodels answers from published entry context only.
Your question is sent to thinkingmodels. The answer uses public entry context only.
RELATED MODELS