English
Related papers

Related papers: Unsupervised Parsing via Constituency Tests

200 papers

Unsupervised extractive summarization aims to extract salient sentences from a document as the summary without labeled data. Recent literatures mostly research how to leverage sentence similarity to rank sentences in the order of salience.…

Computation and Language · Computer Science 2023-02-27 Shichao Sun , Ruifeng Yuan , Wenjie Li , Sujian Li

Processing sentence constituency trees in binarised form is a common and popular approach in literature. However, constituency trees are non-binary by nature. The binarisation procedure changes deeply the structure, furthering constituents…

Machine Learning · Computer Science 2020-11-03 Daniele Castellana , Davide Bacciu

We introduce a generic seq2seq parsing framework that casts constituency parsing problems (syntactic and discourse parsing) into a series of conditional splitting decisions. Our parsing model estimates the conditional probability…

Computation and Language · Computer Science 2021-07-01 Thanh-Tung Nguyen , Xuan-Phi Nguyen , Shafiq Joty , Xiaoli Li

We present a deep generative model for unsupervised text style transfer that unifies previously proposed non-generative techniques. Our probabilistic approach models non-parallel data from two domains as a partially observed parallel…

Computation and Language · Computer Science 2020-05-01 Junxian He , Xinyi Wang , Graham Neubig , Taylor Berg-Kirkpatrick

Recent latent tree learning models can learn constituency parsing without any exposure to human-annotated tree structures. One such model is ON-LSTM (Shen et al., 2019), which is trained on language modelling and has near-state-of-the-art…

Computation and Language · Computer Science 2020-10-13 Yian Zhang

We present RepRank, an unsupervised graph-based ranking model for extractive multi-document summarization in which the similarity between words, sentences, and word-to-sentence can be estimated by the distances between their vector…

Computation and Language · Computer Science 2023-07-25 Zongyi Li , Xiaoqing Zheng , Jun He

In this paper, we propose a variational approach to unsupervised sentiment analysis. Instead of using ground truth provided by domain experts, we use target-opinion word pairs as a supervision signal. For example, in a document snippet "the…

Computation and Language · Computer Science 2020-08-24 Ziqian Zeng , Wenxuan Zhou , Xin Liu , Zizheng Lin , Yangqin Song , Michael David Kuo , Wan Hang Keith Chiu

Self-training has proven to be an effective approach for cross-domain tasks, and in this study, we explore its application to cross-domain constituency parsing. Traditional self-training methods rely on limited and potentially low-quality…

Computation and Language · Computer Science 2023-11-07 Jianling Li , Meishan Zhang , Peiming Guo , Min Zhang , Yue Zhang

Consensus maximisation learning can provide self-supervision when different views are available of the same data. The distributional hypothesis provides another form of useful self-supervision from adjacent sentences which are plentiful in…

Computation and Language · Computer Science 2019-05-08 Shuai Tang , Virginia R. de Sa

We present a statistical parsing framework for sentence-level sentiment classification in this article. Unlike previous works that employ syntactic parsing results for sentiment analysis, we develop a statistical parser to directly analyze…

Computation and Language · Computer Science 2015-03-06 Li Dong , Furu Wei , Shujie Liu , Ming Zhou , Ke Xu

Unsupervised sentence representation learning has progressed through contrastive learning and data augmentation methods such as dropout masking. Despite this progress, sentence encoders are still limited to using only an input sentence when…

Computation and Language · Computer Science 2023-05-19 Yeon Seonwoo , Guoyin Wang , Changmin Seo , Sajal Choudhary , Jiwei Li , Xiang Li , Puyang Xu , Sunghyun Park , Alice Oh

Generative neural models have recently achieved state-of-the-art results for constituency parsing. However, without a feasible search procedure, their use has so far been limited to reranking the output of external parsers in which decoding…

Computation and Language · Computer Science 2017-07-31 Mitchell Stern , Daniel Fried , Dan Klein

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

We propose a new method for evaluating the readability of simplified sentences through pair-wise ranking. The validity of the method is established through in-corpus and cross-corpus evaluation experiments. The approach correctly identifies…

Computation and Language · Computer Science 2016-03-22 Sowmya Vajjala , Detmar Meurers

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

Generative models defining joint distributions over parse trees and sentences are useful for parsing and language modeling, but impose restrictions on the scope of features and are often outperformed by discriminative models. We propose a…

Computation and Language · Computer Science 2017-08-18 Jianpeng Cheng , Adam Lopez , Mirella Lapata

Most sentence embedding techniques heavily rely on expensive human-annotated sentence pairs as the supervised signals. Despite the use of large-scale unlabeled data, the performance of unsupervised methods typically lags far behind that of…

Computation and Language · Computer Science 2022-11-01 Yiming Chen , Yan Zhang , Bin Wang , Zuozhu Liu , Haizhou Li

Unsupervised extractive summarization is an important technique in information extraction and retrieval. Compared with supervised method, it does not require high-quality human-labelled summaries for training and thus can be easily applied…

Artificial Intelligence · Computer Science 2023-12-19 Renlong Jie , Xiaojun Meng , Xin Jiang , Qun Liu

A number of differences have emerged between modern and classic approaches to constituency parsing in recent years, with structural components like grammars and feature-rich lexicons becoming less central while recurrent neural network…

Computation and Language · Computer Science 2018-04-24 David Gaddy , Mitchell Stern , Dan Klein

Cross-lingual word embeddings aim to bridge the gap between high-resource and low-resource languages by allowing to learn multilingual word representations even without using any direct bilingual signal. The lion's share of the methods are…

Computation and Language · Computer Science 2020-09-03 Magdalena Biesialska , Marta R. Costa-jussà