Weakly Supervised Semantic Parsing with Execution-based Spurious Program Filtering (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods to train a semantic parser from weak supervision focus on exploiting similarities between examples based on domain-specific knowledge. |
| Approach: | They propose a domain-agnostic filtering mechanism based on program execution results to identify and filter out programs with significantly different semantics from the other programs. |
| Outcome: | The proposed method improves the performance of existing weakly-supervised parsers by incorporating a majority vote on the program search results. |
Similar Papers
Enforcing Consistency in Weakly Supervised Semantic Parsing (2021.acl-short)
Copied to clipboard
| Challenge: | Existing methods for training semantic parsers from only (utterance, denotation) supervision are challenging. |
| Approach: | They propose to use consistency between output programs for related inputs to reduce the impact of spurious programs. |
| Outcome: | The proposed formalisms improve model performance even without consistency-based training. |
Weakly Supervised Semantic Parsing with Abstract Examples (P18-1)
Copied to clipboard
| Challenge: | training semantic parsers from weak supervision complicates training in two ways . spurious programs that accidentally lead to a correct denotation add noise to training . |
| Approach: | They propose to use tokens in both language utterance and program to map denotations to executable programs. |
| Outcome: | The proposed method improves performance and reaches 82.5% accuracy compared to the best reported accuracy so far. |
Unified Semantic Parsing with Weak Supervision (P19-1)
Copied to clipboard
Priyanka Agrawal, Ayushi Dalmia, Parag Jain, Abhishek Bansal, Ashish Mittal, Karthik Sankaranarayanan
| Challenge: | Semantic parsing over multiple knowledge bases requires high-quality annotations of (utterance, program) pairs. |
| Approach: | They propose a framework to build a unified multi-domain enabled semantic parser with weak supervision. |
| Outcome: | The proposed model improves performance by 20% on the Overnight dataset. |
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. |
Learning from Executions for Semantic Parsing (2021.naacl-main)
Copied to clipboard
| Challenge: | Semantic parsing aims at translating natural language (NL) utterances onto machine-interpretable programs. |
| Approach: | They propose to encourage a parser to generate executable programs for unlabeled NL utterances. |
| Outcome: | The proposed training objectives outperform conventional methods on Overnight and GeoQuery. |
Learning to Generate Programs for Table Fact Verification via Structure-Aware Semantic Parsing (2022.acl-long)
Copied to clipboard
| Challenge: | Existing methods for table fact verification do not study generating latent programs from statements . current weakly supervised methods are limited due to huge search space with lots of spurious programs. |
| Approach: | They propose a structure-aware approach to do table fact verification by structure-based parsing . they leverage lexical features and structure features to generate program from statements . |
| Outcome: | The proposed method generates programs more accurately than existing parsers and achieves comparable performance to the SOTA on the large-scale benchmark TABFACT. |
Weakly Supervised Semantic Parsing by Learning from Mistakes (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Weakly supervised semantic parsing requires searching consistent logical forms in a huge space and dealing with spurious logical form. |
| Approach: | They propose a learning framework that trains parsers via utterance-denotation pairs . they use utterrance-logical form pairs created from mistakes to bootstrap parser . |
| Outcome: | The proposed framework outperforms state-of-the-art methods on WikiSQL, TabFact and other datasets. |
Prototype-Representations for Training Data Filtering in Weakly-Supervised Information Extraction (2022.emnlp-industry)
Copied to clipboard
| Challenge: | Weak supervision and data programming are powerful tools to support information extraction models. |
| Approach: | They propose a prototype-based method to denoise weakly supervised training data . they use a model to model the correct contexts for a given target value . |
| Outcome: | The proposed method achieves 9% accuracy gain in attribute value extraction in e-commerce websites. |
Online Semantic Parsing for Latency Reduction in Task-Oriented Dialogue (2022.acl-long)
Copied to clipboard
| Challenge: | Standard conversational semantic parsing maps a user's intent into an executable program, but execution is slow when expensive function calls are included. |
| Approach: | They propose a task of online semantic parsing to predict and execute function calls while the user is still speaking. |
| Outcome: | The proposed approach reduces latency with good parsing quality and execution cost. |
Weak Reward Model Transforms Generative Models into Robust Causal Event Extraction Systems (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing evaluation metrics that reflect the performance of causal event extraction tasks are poorly reflecting the inherent ambiguity of cause and effect boundaries. |
| Approach: | They propose to use a weak-to-strong supervision method to train an evaluation model while still achieving high performance in training an RL model. |
| Outcome: | The proposed method achieves high agreement with human-annotated data while still achieving high performance in training an RL model. |