| Challenge: | UCCA parsing is a test case for multitask learning, with auxiliary tasks AMR, SDP and Universal Dependencies (UD) . Semantic parsers have arguably yet to reach their full potential due to the limited amount of semantically annotated training data. |
| Approach: | They propose a general transition-based parser that can parse UCCA, AMR, SDP and Universal Dependencies (UD) they use a transition-driven learning architecture and a uniform transition-basic learning architecture to train the parsers. |
| Outcome: | The proposed parser improves UCCA, AMR, SDP and Universal Dependencies (UD) parsing over training in English, German and French. |
Similar Papers
Multitask Learning for Cross-Lingual Transfer of Broad-coverage Semantic Dependencies (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for developing broad-coverage semantic dependency parsers for languages without semantically annotated data are limited to English, Czech and Chinese. |
| Approach: | They propose a multitask learning framework coupled with annotation projection to build broad-coverage semantic dependency parsers for languages without annotated resources. |
| Outcome: | The proposed model improves labeled F1 score on multitask tasks from English to Czech compared to baseline models . |
What can we learn from Semantic Tagging? (D18-1)
Copied to clipboard
| Challenge: | a recent study shows that multi-task learning improves performance of NLP tasks by exploiting similarities between tasks. |
| Approach: | They employ semantic tagging as an auxiliary task for three NLP tasks . they compare full neural network sharing, partial neural network shared and learning what to share . |
| Outcome: | The proposed model improves for part-of-speech tagging, universal dependency parsing and natural language inference. |
Sequence Labeling Parsing by Learning across Representations (P19-1)
Copied to clipboard
| Challenge: | Constituency and dependency parsing are the main abstractions for representing syntactic structure of sentences . constituency parsers are considered disjointed tasks, and their improvements have been obtained separately. |
| Approach: | They propose to add auxiliary loss to constituency parsing paradigms and explore a model that parses both paradigms at no cost. |
| Outcome: | The proposed model outperforms single-task models by 1.05 F1 points and 0.62 UAS points for constituency parsing and dependency parsers. |
Broad-Coverage Semantic Parsing as Transduction (D19-1)
Copied to clipboard
| Challenge: | Existing approaches to broad-coverage semantic parsing are not applicable to all frameworks because of the lack of explicit alignments between tokens in the sentence and nodes in the semantic graph. |
| Approach: | They propose a transduction parsing paradigm that unifies different broad-coverage semantic parsers into a paradigm that leverages multiple attention mechanisms to build meaning representation. |
| Outcome: | The proposed approach improves state-of-the-art on AMR, SDP and UCCA and is competitive with the state- of-the art on SDP. |
Tied Multitask Learning for Neural Speech Translation (N18-1)
Copied to clipboard
| Challenge: | Recent efforts in endangered language documentation focus on collecting spoken language resources . BULB project uses mobile app to collect spoken resources accompanied by spoken translations . |
| Approach: | They propose a model where the second task decoder receives information from the first task . they apply regularization that encourages transitivity and invertibility to the model . |
| Outcome: | The proposed model improves performance on low-resource speech transcription and translation tasks. |
ATP: AMRize Then Parse! Enhancing AMR Parsing with PseudoAMRs (2022.findings-naacl)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) implicitly involves compound semantic annotations. |
| Approach: | They propose to use auxiliary tasks which are semantically or formally related to enhance AMR parsing. |
| Outcome: | The proposed method achieves state-of-the-art performance on benchmarks especially in topology-related scores. |
Multiple Tasks Integration: Tagging, Syntactic and Semantic Parsing as a Single Task (2021.eacl-main)
Copied to clipboard
| Challenge: | Existing systems that bypass intermediate levels of analysis are prone to error propagation and are therefore free from interference. |
| Approach: | They propose a multitask paradigm orthogonal to weight sharing that uses multiple tasks to process input iteratively but concurrently at multiple levels of analysis. |
| Outcome: | The proposed model uses reinforcement learning and release from sequential constraints to improve the quality of the syntactic and semantic parses. |
Cross-lingual Semantic Representation for NLP with UCCA (2020.coling-tutorials)
Copied to clipboard
| Challenge: | introductory tutorial to UCCA, a symbolic meaning representation for semantic representations. |
| Approach: | This tutorial introduces UCCA, a cross-linguistically applicable framework for semantic representation . it will provide a detailed introduction to the UCca annotation guidelines, design philosophy and available resources . |
| Outcome: | The tutorial will provide a detailed introduction to the UCCA framework and compare it to other meaning representations. |
SGL: Speaking the Graph Languages of Semantic Parsing via Multilingual Translation (2021.naacl-main)
Copied to clipboard
| Challenge: | Graph-based semantic parsing is one of the most promising general-purpose meaning representations . owing to this heterogeneity, most research focused on solutions specific to a given formalism . |
| Approach: | They propose a multilingual neural machine translation framework for Graph-based semantic parsing . they propose Graph2seq architecture that trains with an MNMT objective . |
| Outcome: | The proposed framework outperforms all competitors on cross-lingual parsing tasks. |
Multitask Easy-First Dependency Parsing: Exploiting Complementarities of Different Dependency Representations (2020.coling-main)
Copied to clipboard
| Challenge: | Existing dependency parsing models for Arabic use complementary annotations, CATiB and UD treebanks, and partially created trees for one annotation are also available to the other as features for the score function. |
| Approach: | They propose to use Arabic dependency annotations to parse projective dependency trees using CATiB and UD treebanks. |
| Outcome: | The proposed model gives 9.9% error reduction on CATiB and 6.1% on UD compared to a strong baseline and ablation tests show that the main contribution is given by sharing tree representation between tasks, and not simply sharing biLSTM layers as is often performed in NLP multitask systems. |