cs.CLNov 9, 2026

A generalized transition framework for identifying reduction domains in non-binary constituency parsing

Authors: Jungyeul Park, Zihao Huang, Eunkyul Leah Jo

Organizations: KAIST South Korea · UBC Canada

Abstract

Direct non-binary constituency parsing must identify an ordered sequence of children at each phrase-level reduction. We extend our earlier delimiter-guided bottom-up construction to a common calculus for top-down, in-order, and bottom-up parsing. At reduction, the rightmost delimiter marks the left boundary, the nonterminal marker supplies the mother label, and the completed items in the delimited segment determine the children and arity. We use a stack invariant to prove soundness and completeness and derive the exact length of the static oracle's action sequence. A projection-and-lifting theorem shows that each delimiter-guided system and its canonical counterpart generate the same set of trees under both the structural and grammar-licensed transition relations. In controlled experiments on PTB and CTB, the delimiter-guided parsers achieve similar labeled accuracy to their canonical counterparts across all traversal orders. For bottom-up parsing, delimiter guidance reduces the number of action classes and increases the number of supervised decisions per tree.

Figures & tables

Appendix figures & tables1 asset

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Non-binary bottom-up constituency parsing without arity actions

    Jul 12, 2026Jungyeul Park, Eunkyul Leah Jo, Zihao HuangConstituency Parsing

  2. Better heads do not guarantee better binarized constituency parsing

    May 27, 2026Zeyao Qi, Yige Chen, Eitan Klinger +2Constituency Parsing