arxiv
PublishedJuly 14, 2026 at 4:00 AM
Non-binary bottom-up constituency parsing without arity actions
Publisher summary· verbatim
arXiv:2607.10591v1 Announce Type: new Abstract: Non-binary bottom-up constituency parsing is usually taken to require arity actions: reductions such as \(\textsc{Reduce-}X\#k\) specify both the mother label and the number of children to be composed. We show that this arity parameter is not a necessa
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivArticulate Intuition or Genuine Analysis? Benchmarking Epistemic Reliability in LLM-as-a-Judge Peer Reviews3harxivUNIBROWSE: A Data-to-Agent Framework for Multimodal BrowseComp3harxivDemographic Prompting at Scale: When More Attributes Hurt LLM--Human Agreement3harxivEval-Pair Matrix: Answer-Paired Meta-Evaluation of LLM Judges for Grounded RAG3hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗