Reproduce “A generalized transition framework for identifying reduction domains in non-binary constituency parsing” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Jungyeul Park, Zihao Huang, Eunkyul Leah Jo
The authors present a generalized direct non-binary constituency parser that builds each phrase from its ordered children without intermediate binary nodes. It marks the reduction boundary, supplies the parent label, and uses completed children to determine arity across traversal orders. Formal systems preserve tree-building capacity; experiments find similar labeled accuracy, while bottom-up decoding uses more actions and has lower PTB throughput.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.