Multi-Task Semantic Dependency Parsing with Policy Gradient for Learning Easy-First Strategies (P19-1)
Copied to clipboard
| Challenge: | Existing dependency parsing algorithms do not support directed acyclic graphs . a a systole-based dependency parses sentences using binary semantic relations that are not trees . |
| Approach: | They propose an iterative predicate selection algorithm for semantic dependency parsing . they train the algorithm using multi-task learning and task-specific policy gradient training . |
| Outcome: | The proposed model achieves a new state of the art on the SemEval 2015 task 18 dataset . |
Similar Papers
DynGL-SDP: Dynamic Graph Learning for Semantic Dependency Parsing (2022.coling-1)
Copied to clipboard
| Challenge: | Existing parsers that learn graph representations based on static graphs are error-prone and disjointed . Graph-based parser can parse sentences efficiently but suffer from error propagation . |
| Approach: | They propose a dynamic graph learning framework to learn graph representations based on a static graph constructed by an existing parser. |
| Outcome: | The proposed parser outperforms the previous parsers on the SemEval-2015 task 18 dataset in three languages. |
Learning to Retrieve Iteratively for In-Context Learning (2024.emnlp-main)
Copied to clipboard
Yunmo Chen, Tongfei Chen, Harsh Jhamtani, Patrick Xia, Richard Shin, Jason Eisner, Benjamin Van Durme
| Challenge: | In-context learning is a powerful tool for learning large language models. |
| Approach: | They propose an iterative retrieval framework that empowers retrievers to make iterable decisions through policy optimization. |
| Outcome: | The proposed framework outperforms existing methods on semantic parsing datasets with 4M additional parameters for state encoding. |
Infusing Finetuning with Semantic Dependencies (2021.tacl-1)
Copied to clipboard
| Challenge: | Several diagnostics help to localize the benefits of our approach. |
| Approach: | They apply convolutional graph encoders to integrate semantic parses into task-specific finetuning. |
| Outcome: | The proposed approach yields benefits to natural language understanding (NLU) tasks in the GLUE benchmark. |
Auxiliary tasks to boost Biaffine Semantic Dependency Parsing (2022.findings-acl)
Copied to clipboard
| Challenge: | Semantic dependency parsing (SDP) is a task of producing a dependency graph for a sentence. |
| Approach: | They propose to use simple auxiliary tasks that introduce some form of interdependence between arcs to circumvent such an independence of decision. |
| Outcome: | The proposed method shows modest but systematic performance gains on a near-state-of-the-art baseline using transformer-based contextualized representations. |
Jointly Predicting Predicates and Arguments in Neural Semantic Role Labeling (P18-2)
Copied to clipboard
| Challenge: | Recent models that use gold predicates only use a single predicate at a time. |
| Approach: | They propose an end-to-end approach for jointly predicting all predicates, arguments spans, and the relations between them. |
| Outcome: | The proposed model can model overlapping spans across different predicates in the same output structure without gold predicate predications. |
Transition-based Semantic Dependency Parsing with Pointer Networks (2020.acl-main)
Copied to clipboard
| Challenge: | Existing dependency parsers cannot be directly applied, so they need to be adaptable to deal with the absence of singlehead and connectedness constraints. |
| Approach: | They propose a transition system that produces labelled directed acyclic graphs and performs semantic dependency parsing with Pointer Networks. |
| Outcome: | The proposed system outperforms graph-based models and outperformed existing models on a harder NLP problem. |
Few-Shot Semantic Dependency Parsing via Graph Contrastive Learning (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing graph neural networks (GNNs) have shown promising performance on semantic dependency parsing (SDP) training a high-performing model requires a large amount of labeled data and it is prone to over-fitting in the absence of sufficient labele . |
| Approach: | They propose a syntax-guided graph contrastive learning framework to train GNNs with unlabeled data and fine-tune pre-trained GNN models with few-shot labeled SDP data. |
| Outcome: | The proposed framework achieves promising results when few-shot training samples are available. |
Semantics as a Foreign Language (D18-1)
Copied to clipboard
| Challenge: | (2017): Syntactic grammars capture propositions, but graph-based representations aim to capture a wider notion of propositions. |
| Approach: | They propose a neural sequence-to-sequence framework which can recover syntactic linearizations by a sequence-based approach. |
| Outcome: | The proposed framework performs almost on-par with previous state-of-the-art approaches while requiring less parallel training annotations. |
Iterative Span Selection: Self-Emergence of Resolving Orders in Semantic Role Labeling (2022.coling-1)
Copied to clipboard
| Challenge: | Semantic role labeling is the task of labeling semantic arguments for marked semantic predicates. |
| Approach: | They propose a model which combines global decoding and iterative identification for the semantic arguments to consider their roles and relations in the labeling order. |
| Outcome: | The proposed model outperforms existing models in the benchmark datasets of span-based SRL: CoNLL-2005 and CoNll-2012. |
Semi-Supervised Semantic Dependency Parsing Using CRF Autoencoders (2020.acl-main)
Copied to clipboard
| Challenge: | Semantic dependency parsing allows words to have multiple dependency heads, resulting in graph-structured representations. |
| Approach: | They propose an approach to semi-supervised learning of semantic dependency parsers based on the CRF autoencoder framework. |
| Outcome: | The proposed model improves over the baseline model and is arc-factored. |