Hugging Face Trending Papers July 9, 2026

Holographic Neural PCFG for Unsupervised Parsing

Read the original on Hugging Face Trending Papers →

Unsupervised constituency parsing aims to accurately induce latent tree structures from raw text alone. Recent neural parameterizations of PCFGs achieve strong performance in both supervised and unsupervised parsing, yet rely on high-capacity black-box networks for rule scoring -- as exemplified by the Neural PCFG family -- leaving rule probabilities without an interpretable mathematical form.

Summary generated by The Flow from the publisher's feed. The full article lives at Hugging Face Trending Papers.

arXiv Machine Learning

Jul 10

Holographic Neural PCFG for Unsupervised Parsing

arXiv:2607. 08063v1 Announce Type: cross Abstract: Unsupervised constituency parsing aims to accurately induce latent tree structures from raw text alone.

By Ryosuke Yamaki, Daichi Mochihashi, Nobutaka Shimada, Tadahiro Taniguchi

rag computer-vision benchmarks

arXiv Machine Learning

Jun 2

Deep networks learn to parse uniform-depth context-free languages from local statistics

arXiv:2602. 06065v3 Announce Type: replace-cross Abstract: Understanding how the structure of language can be learned from sentences alone is a central question in both cognitive science and machine learning.

By Jack T. Parley, Francesco Cagnetta, Matthieu Wyart

llms

arXiv Machine Learning

Jun 25

Weave of Formal Thought

arXiv:2606. 25987v1 Announce Type: cross Abstract: Large language models (LLMs) attain remarkable surface fluency on code, yet they neither formally guarantee the syntactic validity of their output nor leverage the hierarchical structure defining the target language.

By Alexandre Bouayad

llms nlp fine-tuning

arXiv AI

1d ago

Structural Generalization on SLOG without Hand-Written Rules

arXiv:2604. 26157v4 Announce Type: replace-cross Abstract: Structural generalization in semantic parsing requires systems to apply learned compositional rules to novel structural combinations.

By Zichao Wei

llms benchmarks

arXiv AI

Jul 7

RLIE: Rule Generation with Logistic Regression, Iterative Refinement, and Evaluation for Large Language Models

arXiv:2510. 19698v3 Announce Type: replace Abstract: Large Language Models (LLMs) can propose rules in natural language, sidestepping the need for a predefined predicate space in traditional rule learning.

By Yang Yang, Hua XU, Zhangyi Hu, Yutao Yue

llms

arXiv Machine Learning

Aug 12

The Parser Already Knows: Lightweight Bias Correction in Constrained Decoding

arXiv:2608. 10137v1 Announce Type: cross Abstract: Grammar Constrained Decoding (GCD) forces Language Models (LMs) to produce syntactically valid outputs by masking out non-conforming tokens at each step.

By I\c{s}{\i}l \"Ozg\"u, Yaoxuan Wu, Guy Van den Broeck, Miryung Kim

llms efficiency safety

Related stories

Holographic Neural PCFG for Unsupervised Parsing

Deep networks learn to parse uniform-depth context-free languages from local statistics

Weave of Formal Thought

Structural Generalization on SLOG without Hand-Written Rules

RLIE: Rule Generation with Logistic Regression, Iterative Refinement, and Evaluation for Large Language Models

The Parser Already Knows: Lightweight Bias Correction in Constrained Decoding