paper-with-me

Papers

Unsupervised Learning of Explainable Parse Trees for Improved Generalisation

2021-04-11 · Atul Sahay, Ayush Maheshwari, Ritesh Kumar, Ganesh Ramakrishnan, Manjesh Kumar Hanawal, Kavi Arya

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.

📄 PDF Abstract BibTeX arXiv:2104.04998

Code (1)

atul04/Explainable-Latent-Structures-Using-Attention 공식 구현 pytorch

Tasks

Natural Language InferenceSentenceSentiment Analysis

Similar Papers 제목 키워드 기반

Unsupervised Dependency Parsing: Let's Use Supervised Parsers

2015-04-18 · HLT 2015 5 · Phong Le, Willem Zuidema

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 Parsing

Kernel KMeans clustering splits for end-to-end unsupervised decision trees

2024-02-19 · Louis Ohl, Pierre-Alexandre Mattei, Mickaël Leclercq, Arnaud Droit 외

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-…

Clustering

Heads-up! Unsupervised Constituency Parsing via Self-Attention Heads

2020-10-19 · Asian Chapter of the Association for Computational Linguistics 2020 · Bowen Li, Taeuk Kim, Reinald Kim Amplayo, Frank Keller

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 Parsing

Jointly Learning Sentence Embeddings and Syntax with Unsupervised Tree-LSTMs

2017-05-25 · ICLR 2018 1 · Jean Maillard, Stephen Clark, Dani Yogatama

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 Embeddings

Cascading and Direct Approaches to Unsupervised Constituency Parsing on Spoken Sentences

2023-03-15 · Yuan Tseng, Cheng-I Lai, Hung-Yi Lee

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