Unsupervised Learning of Explainable Parse Trees for Improved Generalisation
Recursive neural networks (RvNN) have been shown useful for learning sentence representations and helped achieve competitive performance on several natural language inference tasks. However, recent RvNN-based models fail to learn simple grammar and meaningful semantics in their intermediate tree representation. In this work, we propose an attention mechanism over Tree-LSTMs to learn more meaningful and explainable parse tree structures. We also demonstrate the superior performance of our proposed model on natural language inference, semantic relatedness, and sentiment analysis tasks and compare them with other state-of-the-art RvNN based methods. Further, we present a detailed qualitative and quantitative analysis of the learned parse trees and show that the discovered linguistic structures are more explainable, semantically meaningful, and grammatically correct than recent approaches. The source code of the paper is available at https://github.com/atul04/Explainable-Latent-Structures-Using-Attention.
Code (1)
Tasks
Natural Language InferenceSentenceSentiment AnalysisSimilar Papers 제목 키워드 기반
Unsupervised Dependency Parsing: Let's Use Supervised Parsers
We present a self-training approach to unsupervised dependency parsing that reuses existing supervised and unsupervised parsing algorithms. Our approach, called `iterated reranking' (IR), starts with dependency trees gen…
Dependency ParsingRerankingUnsupervised Dependency ParsingKernel KMeans clustering splits for end-to-end unsupervised decision trees
Trees are convenient models for obtaining explainable predictions on relatively small datasets. Although there are many proposals for the end-to-end construction of such trees in supervised learning, learning a tree end-…
ClusteringHeads-up! Unsupervised Constituency Parsing via Self-Attention Heads
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. Previou…
Constituency ParsingJointly Learning Sentence Embeddings and Syntax with Unsupervised Tree-LSTMs
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 diff…
Natural Language InferenceReverse DictionarySentenceSentence EmbeddingsCascading and Direct Approaches to Unsupervised Constituency Parsing on Spoken Sentences
Past work on unsupervised parsing is constrained to written form. In this paper, we present the first study on unsupervised spoken constituency parsing given unlabeled spoken sentences and unpaired textual data. The goal…
Automatic Speech RecognitionAutomatic Speech Recognition (ASR)Constituency ParsingInductive Bias+2