analiza aiqbench
This research investigates how linearizing syntactic trees in Transformer Grammars affects model performance by comparing Depth-First, Breadth-First, and hybrid traversal strategies. The study empirically evaluates these methods across language modeling and summarization tasks to reveal trade-offs between structural lookahead and early lexical generation for task-aware design.
Does Traversal Order Matter? A Systematic Study of Tree Traversal Methods in Transformer Grammars
arXiv:2606.16836v1 Announce Type: new Abstract: Transformer Grammars (TGs) enhance language modeling by incorporating syntactic tree structures. Despite the potentially significant impact on model performance of how syntactic trees are linearized in TGs, existing studies rely solely on Depth-First Traversal (DFT) for linearization. In this paper, we expand the traversal design space by exploring Breadth-First Traversal (BFT) and a novel hybrid traversal strategy, Production-Rule Traversal (PRT), which combines the structural lookahead of BFT with the early lexical generation of DFT. We integrate these traversal methods with varying tree configurations and masking strategies, and empirically evaluate their performance on language modeling, syntactic generalization and summarization. We reveal the inherent trade-offs between nested composition and global lookahead, providing actionable recommendations for designing task-aware Transformer Grammars.
Title:Does Traversal Order Matter? A Systematic Study of Tree Traversal Methods in Transformer Grammars
Abstract:Transformer Grammars (TGs) enhance language modeling by incorporating syntactic tree structures. Despite the potentially significant impact on model performance of how syntactic trees are linearized in TGs, existing studies rely solely on Depth-First Traversal (DFT) for linearization. In this paper, we expand the traversal design space by exploring Breadth-First Traversal (BFT) and a novel hybrid traversal strategy, Production-Rule Traversal (PRT), which combines the structural lookahead of BFT with the early lexical generation of DFT. We integrate these traversal methods with varying tree configurations and masking strategies, and empirically evaluate their performance on language modeling, syntactic generalization and summarization. We reveal the inherent trade-offs between nested composition and global lookahead, providing actionable recommendations for designing task-aware Transformer Grammars.
Computation and Language (cs.CL)
arXiv:2606.16836 [cs.CL]
(or arXiv:2606.16836v1 [cs.CL] for this version)
https://doi.org/10.48550/arXiv.2606.16836 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 226 cuvinte
Subiecte conexe

Concrete Evaluations to Investigate the OpenAI Model That Hacked Hugging Face
AI Alignment Forum · 3 aug. 2026

Six Principles of Voice Design: Designing for the Ear and Encoding It into Agent Script
Salesforce Blog · 8 oct. 2026
A Test Suite for Concepts
LessWrong · 16 iun. 2026

The Entangled Dimensions of Decision Theory
LessWrong · 30 iul. 2026