English
Related papers

Related papers: Tree Transformers are an Ineffective Model of Synt…

200 papers

Large language models generate code one token at a time. Their autoregressive generation process lacks the feedback of observing the program's output. Training LLMs to suggest edits directly can be challenging due to the scarcity of rich…

Artificial Intelligence · Computer Science 2024-06-03 Shreyas Kapur , Erik Jenner , Stuart Russell

We present a methodology that explores how sentence structure is reflected in neural representations of machine translation systems. We demonstrate our model-agnostic approach with the Transformer English-German translation model. We…

Computation and Language · Computer Science 2022-11-04 Gal Patel , Leshem Choshen , Omri Abend

Machine translation systems require semantic knowledge and grammatical understanding. Neural machine translation (NMT) systems often assume this information is captured by an attention mechanism and a decoder that ensures fluency. Recent…

Computation and Language · Computer Science 2018-05-29 Ke Tran , Yonatan Bisk

The paper surveys recent extensions of the Long-Short Term Memory networks to handle tree structures from the perspective of learning non-trivial forms of isomorph structured transductions. It provides a discussion of modern TreeLSTM…

Machine Learning · Computer Science 2019-02-06 Davide Bacciu , Antonio Bruno

We propose a transition-based approach that, by training a single model, can efficiently parse any input sentence with both constituent and dependency trees, supporting both continuous/projective and discontinuous/non-projective syntactic…

Computation and Language · Computer Science 2022-12-26 Daniel Fernández-González , Carlos Gómez-Rodríguez

Token representations influence the efficiency and adaptability of language models, yet conventional tokenization strategies impose rigid segmentation boundaries that do not adjust dynamically to evolving contextual relationships. The…

Computation and Language · Computer Science 2025-08-11 Alistair Dombrowski , Beatrix Engelhardt , Dimitri Fairbrother , Henry Evidail

Latent tree learning models learn to parse a sentence without syntactic supervision, and use that parse to build the sentence representation. Existing work on such models has shown that, while they perform well on tasks like sentence…

Computation and Language · Computer Science 2018-04-18 Nikita Nangia , Samuel R. Bowman

Large Language Models demonstrate outstanding performance in many language tasks but still face fundamental challenges in managing the non-linear flow of human conversation. The prevalent approach of treating dialogue history as a flat,…

Computation and Language · Computer Science 2026-04-20 Junan Hu , Shudan Guo , Wenqi Liu , Jianhua Yin , Yinwei Wei

One of the key factors in language productivity and human cognition is the ability of systematic compositionality, which refers to understanding composed unseen examples of seen primitives. However, recent evidence reveals that the…

Computation and Language · Computer Science 2023-12-13 Chen Huang , Peixin Qin , Wenqiang Lei , Jiancheng Lv

Transformers have revolutionized machine learning across diverse domains, yet understanding their behavior remains crucial, particularly in high-stakes applications. This paper introduces the contextual counting task, a novel toy problem…

The neural architectures of language models are becoming increasingly complex, especially that of Transformers, based on the attention mechanism. Although their application to numerous natural language processing tasks has proven to be very…

Computation and Language · Computer Science 2023-12-04 Pablo Gamallo

Transformers for language modeling usually rely on deterministic internal computation, with uncertainty expressed mainly at the output layer. We introduce variational neurons into Transformer feed-forward computation so that uncertainty…

Machine Learning · Computer Science 2026-03-31 Yves Ruffenach

Parse trees are fundamental syntactic structures in both computational linguistics and compilers construction. We argue in this paper that, in both fields, there are good incentives for model-checking sets of parse trees for some word…

Logic in Computer Science · Computer Science 2013-08-23 Anudhyan Boral , Sylvain Schmitz

We present a robust methodology for evaluating biases in natural language generation(NLG) systems. Previous works use fixed hand-crafted prefix templates with mentions of various demographic groups to prompt models to generate continuations…

Computation and Language · Computer Science 2022-12-06 Arshiya Aggarwal , Jiao Sun , Nanyun Peng

Theory of tree transducers provides a foundation for understanding expressiveness and complexity of analysis problems for specification languages for transforming hierarchically structured data such as XML documents. We introduce streaming…

Formal Languages and Automata Theory · Computer Science 2012-02-23 Rajeev Alur , Loris D'Antoni

Short text classification is a crucial and challenging aspect of Natural Language Processing. For this reason, there are numerous highly specialized short text classifiers. However, in recent short text research, State of the Art (SOTA)…

Computation and Language · Computer Science 2023-08-14 Fabian Karl , Ansgar Scherp

Designers of autonomous agents, whether in physical or virtual environments, need to express nondeterminisim, failure, and parallelism in behaviors, as well as accounting for synchronous coordination between agents. Behavior Trees are a…

Programming Languages · Computer Science 2018-03-28 Chris Martens , Eric Butler , Joseph C. Osborn

One of the fundamental principles of contemporary linguistics states that language processing requires the ability to extract recursively nested tree structures. However, it remains unclear whether and how this code could be implemented in…

Computation and Language · Computer Science 2021-01-08 Yair Lakretz , Théo Desbordes , Jean-Rémi King , Benoît Crabbé , Maxime Oquab , Stanislas Dehaene

Transformers are arguably the main workhorse in recent Natural Language Processing research. By definition a Transformer is invariant with respect to reordering of the input. However, language is inherently sequential and word order is…

Computation and Language · Computer Science 2021-09-10 Philipp Dufter , Martin Schmitt , Hinrich Schütze

Coherence is an important aspect of text quality and is crucial for ensuring its readability. It is essential desirable for outputs from text generation systems like summarization, question answering, machine translation, question…

Computation and Language · Computer Science 2022-02-24 Tushar Abhishek , Daksh Rawat , Manish Gupta , Vasudeva Varma