English
Related papers

Related papers: StructFormer: Joint Unsupervised Induction of Depe…

200 papers

Headedness is widely used as an organizing device in syntactic analysis, yet constituency treebanks rarely encode it explicitly and most processing pipelines recover it procedurally via percolation rules. We treat this notion of constituent…

Computation and Language · Computer Science 2026-03-17 Zeyao Qi , Yige Chen , KyungTae Lim , Haihua Pan , Jungyeul Park

Recent works show that discourse analysis benefits from modeling intra- and inter-sentential levels separately, where proper representations for text units of different granularities are desired to capture both the meaning of text units and…

Computation and Language · Computer Science 2022-05-05 Yifei Zhou , Yansong Feng

Both humans and large language models are able to learn language without explicit structural supervision. What inductive biases make this learning possible? We address this fundamental cognitive question by leveraging transformer language…

Computation and Language · Computer Science 2023-10-31 Isabel Papadimitriou , Dan Jurafsky

Different from other sequential data, sentences in natural language are structured by linguistic grammars. Previous generative conversational models with chain-structured decoder ignore this structure in human language and might generate…

Artificial Intelligence · Computer Science 2018-01-04 Ganbin Zhou , Ping Luo , Rongyu Cao , Yijun Xiao , Fen Lin , Bo Chen , Qing He

We introduce a method for unsupervised parsing that relies on bootstrapping classifiers to identify if a node dominates a specific span in a sentence. There are two types of classifiers, an inside classifier that acts on a span, and an…

Computation and Language · Computer Science 2022-03-22 Nickil Maveli , Shay B. Cohen

We present an approach for assessing how multilingual large language models (LLMs) learn syntax in terms of multi-formalism syntactic structures. We aim to recover constituent and dependency structures by casting parsing as sequence…

Computation and Language · Computer Science 2023-09-21 Alberto Muñoz-Ortiz , David Vilares , Carlos Gómez-Rodríguez

In this paper we demonstrate that $\textit{context free grammar (CFG) based methods for grammar induction benefit from modeling lexical dependencies}$. This contrasts to the most popular current methods for grammar induction, which focus on…

Computation and Language · Computer Science 2020-07-31 Hao Zhu , Yonatan Bisk , Graham Neubig

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

Syntactic structures used to play a vital role in natural language processing (NLP), but since the deep learning revolution, NLP has been gradually dominated by neural models that do not consider syntactic structures in their design. One…

Computation and Language · Computer Science 2023-11-28 Haoyi Wu , Kewei Tu

Recent analyses suggest that encoders pretrained for language modeling capture certain morpho-syntactic structure. However, probing frameworks for word vectors still do not report results on standard setups such as constituent and…

Computation and Language · Computer Science 2020-02-06 David Vilares , Michalina Strzyz , Anders Søgaard , Carlos Gómez-Rodríguez

As a cornerstone in language modeling, tokenization involves segmenting text inputs into pre-defined atomic units. Conventional statistical tokenizers often disrupt constituent boundaries within words, thereby corrupting semantic…

Computation and Language · Computer Science 2025-07-11 Qingyang Zhu , Xiang Hu , Pengyu Ji , Wei Wu , Kewei Tu

Prior work has shown that structural supervision helps English language models learn generalizations about syntactic phenomena such as subject-verb agreement. However, it remains unclear if such an inductive bias would also improve language…

Computation and Language · Computer Science 2021-09-24 Yiwen Wang , Jennifer Hu , Roger Levy , Peng Qian

One of the most complex syntactic representations used in computational linguistics and NLP are discontinuous constituent trees, crucial for representing all grammatical phenomena of languages such as German. Recent advances in dependency…

Computation and Language · Computer Science 2020-02-06 Daniel Fernández-González , Carlos Gómez-Rodríguez

We study how masking and predicting tokens in an unsupervised fashion can give rise to linguistic structures and downstream performance gains. Recent theories have suggested that pretrained language models acquire useful inductive biases…

Computation and Language · Computer Science 2021-04-13 Tianyi Zhang , Tatsunori Hashimoto

To achieve deep natural language understanding, syntactic constituent parsing plays a crucial role and is widely required by many artificial intelligence systems for processing both text and speech. A recent approach involves using standard…

Computation and Language · Computer Science 2026-05-14 Daniel Fernández-González , Cristina Outeiriño Cid

Most of the unsupervised dependency parsers are based on first-order probabilistic generative models that only consider local parent-child information. Inspired by second-order supervised dependency parsing, we proposed a second-order…

Computation and Language · Computer Science 2020-10-29 Songlin Yang , Yong Jiang , Wenjuan Han , Kewei Tu

We introduce a neural network that represents sentences by composing their words according to induced binary parse trees. We use Tree-LSTM as our composition function, applied along a tree structure found by a fully differentiable natural…

Computation and Language · Computer Science 2020-01-16 Jean Maillard , Stephen Clark , Dani Yogatama

Human language is known to exhibit a nested, hierarchical structure, allowing us to form complex sentences out of smaller pieces. However, many state-of-the-art neural networks models such as Transformers have no explicit hierarchical…

Computation and Language · Computer Science 2023-07-12 Nilay Patel , Jeffrey Flanigan

We study the problem of using (partial) constituency parse trees as syntactic guidance for controlled text generation. Existing approaches to this problem use recurrent structures, which not only suffer from the long-term dependency problem…

Computation and Language · Computer Science 2020-10-06 Yinghao Li , Rui Feng , Isaac Rehg , Chao Zhang

Corpus-based grammar induction generally relies on hand-parsed training data to learn the structure of the language. Unfortunately, the cost of building large annotated corpora is prohibitively expensive. This work aims to improve the…

Computation and Language · Computer Science 2007-05-23 Rebecca Hwa