English
Related papers

Related papers: StructFormer: Joint Unsupervised Induction of Depe…

200 papers

Linear sequences of words are implicitly represented in our brains by hierarchical structures that organize the composition of words in sentences. Linguists formalize different frameworks to model this hierarchy; two of the most common…

Computation and Language · Computer Science 2024-03-18 Omar Momen

Grammar induction has made significant progress in recent years. However, it is not clear how the application of induced grammar could enhance practical performance in downstream tasks. In this work, we introduce an unsupervised grammar…

Computation and Language · Computer Science 2024-10-08 Jushi Kai , Shengyuan Hou , Yusheng Huang , Zhouhan Lin

Syntactic Transformer language models aim to achieve better generalization through simultaneously modeling syntax trees and sentences. While prior work has been focusing on adding constituency-based structures to Transformers, we introduce…

Computation and Language · Computer Science 2024-07-25 Yida Zhao , Chao Lou , Kewei Tu

Constituent and dependency representation for syntactic structure share a lot of linguistic and computational characteristics, this paper thus makes the first attempt by introducing a new model that is capable of parsing constituent and…

Computation and Language · Computer Science 2019-09-27 Junru Zhou , Shuailiang Zhang , Hai Zhao

Linguists have long held that a key aspect of natural language syntax is the recursive organization of language units into constituent structures, and research has suggested that current state-of-the-art language models lack an inherent…

Computation and Language · Computer Science 2024-11-27 Michael Ginn

Most previous work on grammar induction focuses on learning phrasal or dependency structure purely from text. However, because the signal provided by text alone is limited, recently introduced visually grounded syntax models make use of…

Computation and Language · Computer Science 2021-09-22 Ruisi Su , Shruti Rijhwani , Hao Zhu , Junxian He , Xinyu Wang , Yonatan Bisk , Graham Neubig

The underlying structure of natural language is hierarchical; words combine into phrases, which in turn form clauses. An awareness of this hierarchical structure can aid machine learning models in performing many linguistic tasks. However,…

Machine Learning · Computer Science 2020-04-01 Ashok Thillaisundaram

In this thesis, we try to build a connection between the two schools by introducing syntactic inductive biases for deep learning models. We propose two families of inductive biases, one for constituency structure and another one for…

Machine Learning · Computer Science 2022-06-13 Yikang Shen

Unsupervised dependency parsing aims to learn a dependency parser from unannotated sentences. Existing work focuses on either learning generative models using the expectation-maximization algorithm and its variants, or learning…

Computation and Language · Computer Science 2017-09-26 Yong Jiang , Wenjuan Han , Kewei Tu

Recent progress on parse tree encoder for sentence representation learning is notable. However, these works mainly encode tree structures recursively, which is not conducive to parallelization. On the other hand, these works rarely take…

Computation and Language · Computer Science 2022-05-10 Junhua Ma , Jiajun Li , Yuxuan Liu , Shangbo Zhou , Xue Li

Dependency parsing is a fundamental task in natural language processing (NLP), aiming to identify syntactic dependencies and construct a syntactic tree for a given sentence. Traditional dependency parsing models typically construct…

Computation and Language · Computer Science 2025-02-25 Keunha Kim , Youngjoong Ko

Recurrent neural network grammars (RNNG) are generative models of language which jointly model syntax and surface structure by incrementally generating a syntax tree and sentence in a top-down, left-to-right order. Supervised RNNGs achieve…

Computation and Language · Computer Science 2019-08-06 Yoon Kim , Alexander M. Rush , Lei Yu , Adhiguna Kuncoro , Chris Dyer , Gábor Melis

We propose a method for unsupervised parsing based on the linguistic notion of a constituency test. One type of constituency test involves modifying the sentence via some transformation (e.g. replacing the span with a pronoun) and then…

Computation and Language · Computer Science 2020-10-08 Steven Cao , Nikita Kitaev , Dan Klein

Unsupervised dependency parsing, which tries to discover linguistic dependency structures from unannotated data, is a very challenging task. Almost all previous work on this task focuses on learning generative models. In this paper, we…

Computation and Language · Computer Science 2017-08-04 Jiong Cai , Yong Jiang , Kewei Tu

Human beings possess the most sophisticated computational machinery in the known universe. We can understand language of rich descriptive power, and communicate in the same environment with astonishing clarity. Two of the many contributors…

Computation and Language · Computer Science 2021-01-01 Karthikeya Ramesh Kaushik , Andrea E. Martin

Recently, unsupervised parsing of syntactic trees has gained considerable attention. A prototypical approach to such unsupervised parsing employs reinforcement learning and auto-encoders. However, no mechanism ensures that the learnt model…

Computation and Language · Computer Science 2021-05-24 Atul Sahay , Anshul Nasery , Ayush Maheshwari , Ganesh Ramakrishnan , Rishabh Iyer

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

Sequence-based neural networks show significant sensitivity to syntactic structure, but they still perform less well on syntactic tasks than tree-based networks. Such tree-based networks can be provided with a constituency parse, a…

Computation and Language · Computer Science 2020-05-04 Michael A. Lepori , Tal Linzen , R. Thomas McCoy

Transformer-based pre-trained language models (PLMs) have dramatically improved the state of the art in NLP across many tasks. This has led to substantial interest in analyzing the syntactic knowledge PLMs learn. Previous approaches to this…

Computation and Language · Computer Science 2020-10-20 Bowen Li , Taeuk Kim , Reinald Kim Amplayo , Frank Keller

We describe two ``semantically-oriented'' dependency-structure formalisms, U-forms and S-forms. U-forms have been previously used in machine translation as interlingual representations, but without being provided with a formal…

cmp-lg · Computer Science 2008-02-03 Marc Dymetman , Max Copperman
‹ Prev 1 2 3 10 Next ›