cjk-semantic-split 0.1.1

Recursive atomic decomposition of CJK characters with 9-grid spatial encoding

cjk-semantic-split

Recursive atomic decomposition of CJK characters with 9-grid spatial position encoding.

pip install cjk-semantic-split

from chinese_decompose import decompose

decompose("踩")
# '踩 [30]:足 [60]:爪 [80]:木'

decompose("囚")
# '囚 [90]:囗 [0]:人'

decompose("踩好", as_tree=True)
# [DecompositionTree('踩'), DecompositionTree('好')]

# Read the full structural decomposition (preserves intermediate nodes
# like 采 inside 踩; each tree node carries its 2-digit position code).
from chinese_decompose import read_structure
trees = read_structure("踩")
trees[0].atoms     # ('足', '爪', '木')
trees[0].positions # (30, 60, 80)
trees[0].children[1].char  # '采'  (intermediate node preserved!)
trees[0].children[1].position  # 40

Documentation

• Component Position Encoding — full position-code reference (00/10/20/30/40, corners, 4-cell strips, surrounds) and the composition operator.
• Decomposition Logic — algorithm walkthrough, data flow, worked example 踩 → 足 + 采 → 爪 + 木.

Position Encoding

Every component sits at a 2-digit position code: cardinals (10/20/30/40), single-cell corners (50/60/70/80), 4-cell layout strips (14/16/34/36), or surround envelopes (90–99). See the design spec for full details.

CLI

python -m chinese_decompose 踩                  # JSON output (default)
python -m chinese_decompose 踩 --format dsl    # DSL string
python -m chinese_decompose 踩 --format tree   # repr() of nested trees
python -m chinese_decompose --self-test         # coverage report

Data Sources

Decomposition data is bundled for offline use. Coverage extends across four tiers:

• Tier 1 (Unihan kIDS): ~21k chars
• Tier 2 (wikimedia Commons): ~22k chars
• Tier 3 (next-layer harvest): ~80k chars
• Tier 4 (manual patches): dispute-case overrides

Last-wins resolution: patches > l3 > l2 > l1.

Configuration

from chinese_decompose import set_primitives

set_primitives({"木", "火", "水", ...})  # process-local override

License

MIT — see LICENSE.