StructVAE: Tree-structured Latent Variable Models for Semi-supervised Semantic Parsing (P18-1)
Copied to clipboard
| Challenge: | Semantic parsing is the task of transducing natural language (NL) utterances into formal meaning representations (MRs), commonly represented as tree structures. |
| Approach: | They propose a variational auto-encoding model for semi-supervised semantic parsing which learns from limited amounts of parallel data and readily-available unlabeled NL utterances. |
| Outcome: | Experiments on ATIS domain and Python show that with extra unlabeled data, StructVAE outperforms strong supervised models. |
Similar Papers
Latent Structure Models for Natural Language Processing (P19-4)
Copied to clipboard
| Challenge: | Latent structure models are a powerful tool for compositional data modeling and pipelines. |
| Approach: | This tutorial will cover recent advances in discrete latent structure models . it will discuss their motivation, potential, and limitations . |
| Outcome: | This tutorial will cover recent advances in discrete latent structure models . it will discuss their motivation, potential, and limitations . |
StrAE: Autoencoding for Pre-Trained Embeddings using Explicit Structure (2023.emnlp-main)
Copied to clipboard
| Challenge: | Structured Autoencoder framework StrAE enables effective learning of multi-level representations through strict adherence to explicit structure. |
| Approach: | They propose a Structured Autoencoder framework that strictly adheres to explicit structure and uses a contrastive objective over tree-structured representations. |
| Outcome: | The proposed framework outperforms baselines that don’t involve explicit hierarchical compositions and is comparable to models given informative structure. |
Learning Semantic Parsers from Denotations with Latent Structured Alignments and Abstract Programs (D19-1)
Copied to clipboard
| Challenge: | Semantic parsing aims to map natural language utterances onto machine interpretable meaning representations. |
| Approach: | They propose to instill an inductive bias in the parser to help it distinguish between spurious and correct programs. |
| Outcome: | The proposed model is highly tractable on WikiTableQuestions and WikiSQL datasets. |
AMR Parsing with Latent Structural Information (2020.acl-main)
Copied to clipboard
| Challenge: | Abstract Meaning Representations (AMRs) capture sentence-level semantics structural representations to broad-coverage natural sentences. |
| Approach: | They investigate parsing AMR with explicit dependency structures and interpretable latent structures. |
| Outcome: | The proposed model achieves best results on both AMR 2.0 and AMR 1.0 . the proposed model has been adopted in downstream NLP tasks, including text summarization and question answering. |
Learning Sentence Representations over Tree Structures for Target-Dependent Classification (N18-1)
Copied to clipboard
| Challenge: | Existing work on tree structures uses syntactic parsers or Treebank annotations to perform target-dependent classifications. |
| Approach: | They propose a reinforcement learning based approach which automatically induces target-specific sentence representations over tree structures. |
| Outcome: | The proposed model gives superior performance on two benchmark tasks compared to previous work on parsed trees . |
AMR Parsing as Graph Prediction with Latent Alignment (P18-1)
Copied to clipboard
| Challenge: | Abstract meaning representations (AMRs) are sentence-level semantic representations . lack of explicit alignments between nodes in graphs and words in sentences is a challenge . |
| Approach: | They propose a neural parser which treats alignments as latent variables within a joint probabilistic model of concepts, relations and alignments. |
| Outcome: | The proposed parser achieves the best reported results on the standard benchmark (74.4% on LDC2016E25). |
ListOps: A Diagnostic Dataset for Latent Tree Learning (N18-4)
Copied to clipboard
| Challenge: | Existing work on latent tree learning models shows they do not learn plausible grammars . a dataset is created to study the parsing ability of such models in natural language . |
| Approach: | They propose a toy dataset to study the parsing ability of latent tree learning models . they propose 'listops' toy that has a single correct parse strategy that a system needs to learn . |
| Outcome: | The proposed model outperforms existing models on sentence understanding tasks . it can learn grammars that conform to plausible semantics and syntactic formalisms . |
Coarse-to-Fine Decoding for Neural Semantic Parsing (P18-1)
Copied to clipboard
| Challenge: | Experimental results show that semantic parsing is more efficient than using simple decoders. |
| Approach: | They propose a structure-aware neural architecture which decomposes the semantic parsing process into two stages. |
| Outcome: | The proposed architecture consistently improves performance on four datasets characteristic of different domains and meaning representations. |
Towards Dynamic Computation Graphs via Sparse Latent Structure (D18-1)
Copied to clipboard
| Challenge: | Existing approaches to learn latent structure are limited by factorization assumptions or end-to-end differentiability. |
| Approach: | They propose a method that allows for end-to-end learning of latent structure predictors jointly with a downstream predictor. |
| Outcome: | The proposed method allows for unrestricted dynamic graph construction from the global latent structure while maintaining differentiability. |
Exploiting Syntactic Structure for Better Language Modeling: A Syntactic Distance Approach (2020.acl-main)
Copied to clipboard
| Challenge: | incorporating syntactic structure into language models has been a challenge since the 1990s. |
| Approach: | They propose to use syntactic information to integrate syntastic structure into neural language models by providing ground truth parse trees as additional training signals. |
| Outcome: | The proposed model achieves lower perplexity and better quality when ground truth parse trees are provided as training signals. |