Skip to content
Stroke order
Kanji in Order

Stroke order · ordered realization

  • Home
  • Sections
    • Part 1 Start here
    • Part 2 Strokes in sequence
    • Part 3 Components in sequence
    • Part 4 Operator trees
    • Part 5 Characters compared
    • Part 6 By grade and stroke count
    • Part 7 Other ordering processes
    • Part 8 Tools
    • Part 9 Method and sources
  • All articles

Operator trees

A character read as a tree: an operator such as ⿰ or ⿱ takes components as arguments. The number of arguments is the valence, and stroke order is a walk of the tree.

    1. Valence atlas

      Valence is how many immediate slots a character’s top-level composition takes. It is not the stroke count.

    2. Valence at every depth

      How many slots each component node opens, counted down the KanjiVG tree for every jōyō character.

    3. Operator arity at every depth

      For every composition in the 2,136 jōyō files, the operator’s arity at each depth; and, under the same walk, how a flat three-place node compares with a nested binary of the same layout.

    4. Order depth vs stroke rank

      Every stroke of the 2,136 jōyō characters sits at some KanjiVG nesting depth and at some rank k/n. This page sets the two side by side.

    5. How much order the tree leaves free

      For each jōyō character, how many stroke orders keep every KanjiVG group a contiguous block: the product, over the group tree, of the factorial of each node’s number of children, beside the one order the file records.

    6. Which sibling is written first

      For every jōyō character, the KanjiVG group tree is walked at every depth, and each node with two or more children that carry kvg:position is picked out. At each one: which child comes first in space, and whether that child’s strokes also start first in the recorded order.

    7. Operator trees and stroke order

      Each of the 2,136 jōyō characters is written as an operator expression over its KanjiVG component tree. Then: does a depth-first walk of that tree, in spatial order, match the recorded stroke order?

    8. Inferred operators for missing rows

      For each jōyō character that the operator-tree reading left unmapped: whether the bounding boxes of its slots settle an operator, and whether the same depth-first walk then matches the recorded stroke order.

    9. Evaluation rules for the exception classes

      The inside-first, frame-last, and part-split characters, and the four walk-misses, read again as evaluation rules on the operator walk: how many then give stroke 1 through N, how many stay, and whether any earlier hit is lost.

    10. What blocks the 739 unmapped characters

      After the inferred operators and the evaluation rules, 739 jōyō characters still hold a composition with no operator. What blocks each composition? Does a small ordering rule bring any of them into the operator walk?

    11. Shared operator arguments

      Which operator sub-expressions — an operator and its argument elements — recur in two or more jōyō characters, and whether each containing character keeps that operator, that argument order, and that internal stroke walk.

    12. When a shared argument keeps its order but its stroke types differ

      The 102 shared-argument uses that Shared operator arguments puts in its walk cell, read one stroke at a time: is what differs the stroke order itself, or the label given to a stroke’s type?

    13. Written order and walk order as a permutation

      At each of the 4,828 nodes with an operator, the node’s strokes are lined up twice: once in the recorded stroke order, once argument by argument in operator order. Each line is a permutation of the other. For the 122 nodes off the walk: how far, and which argument, has to move to get back to the walk?

    14. The walk as a ranking: Kendall’s τ

      At each of the 4,828 nodes with an operator, the node’s strokes get two ranks: where each was written, and where it falls in the walk. Measured by Kendall’s τ, walk nodes are τ = 1 by definition. This page shows how far the 122 nodes off the walk fall from there.

    15. Grouping sensitivity: the box-reading artefacts and the 122 off-walk nodes

      Of the 122 operator nodes off the walk, the six that do not enclose (別 昼 尽 尺 楽 薬) are read again against their raw boxes; four are judged box-reading artefacts. Under two alternative readings of the same SVG (refuse the artefacts; refuse inferred enclosing operators whose outer argument is discontinuous), the page counts how many of the 122 survive.

    16. Stored entries keep their order?

      For every KanjiVG element that appears in two or more jōyō characters, whether each containing character keeps the letter-stripped stroke-type sequence of the standalone file, or, when there is no file, of one chosen reference occurrence.

Research notes site · subject to revision · Kanji-Morphology

Theory Desk · Grant Golland

Previous: tradForm and radicalForm Next: Valence atlas Operator trees