| Challenge: | Abstract Meaning Representations (AMRs) are graphs which describe the predicate-argument structure of a sentence. |
| Approach: | They propose a semantic parser which parses strings into tree representations of the compositional structure of an AMR graph. |
| Outcome: | The proposed parser outperforms baselines and standard neural techniques for supertagging and dependency tree parsing. |
Similar Papers
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. |
Graph Pre-training for AMR Parsing and Generation (2022.acl-long)
Copied to clipboard
| Challenge: | Abstract meaning representation (AMR) highlights the core semantic information of text in a graph structure. |
| Approach: | They propose two graph auto-encoding strategies for graph-to-graph pre-training and four tasks to integrate text and graph information during pre-tuning to improve structure awareness. |
| Outcome: | The proposed model is superior to pre-trained language models on AMR parsing and AMR-to-text generation tasks. |
Compositional Semantic Parsing across Graphbanks (P19-1)
Copied to clipboard
| Challenge: | Existing semantic parsers that map sentences to graph-based meaning representations are hand-designed for specific graphbanks. |
| Approach: | They propose a compositional neural semantic parser which achieves competitive accuracies across graphbanks. |
| Outcome: | The proposed system achieves competitive accuracies across a variety of graphbanks. |
Fast semantic parsing with well-typedness guarantees (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing algorithms for AM dependency parsing are slow and do not support linguistic principles. |
| Approach: | They propose an A* parser and a transition-based parsing algorithm which guarantee well-typedness and improve parse speed by up to 3 orders of magnitude. |
| Outcome: | The proposed algorithms guarantee well-typedness and improve parsing speed by up to 3 orders of magnitude while maintaining or improving accuracy. |
Pushing the Limits of AMR Parsing with Self-Learning (2020.findings-emnlp)
Copied to clipboard
Young-Suk Lee, Ramón Fernandez Astudillo, Tahira Naseem, Revanth Gangi Reddy, Radu Florian, Salim Roukos
| Challenge: | Abstract Meaning Representation (AMR) parsing has experienced a notable growth in performance in the last two years due to the impact of transfer learning and the development of novel architectures specific to AMR. |
| Approach: | They propose to use AMR annotations to generate synthetic text and refine actions oracle without additional human annotations for AMR parsing. |
| Outcome: | The proposed models improve on AMR 1.0 and 2.0 without human annotations. |
World Knowledge for Abstract Meaning Representation Parsing (L18-1)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) parsers are based on annotated graphs, but there is still room for improvement . |
| Approach: | They examine the role played by world knowledge in parsing errors in a state-of-the-art parser . they examine the effects of different types of world knowledge on parsers . |
| Outcome: | The proposed model improves on multiple fine-grained metrics, including a 6% increase in named entity F-score, and provides insight into the potential of world knowledge for future work in Abstract Meaning Representation parsing. |
Abstract Meaning Representation Guided Graph Encoding and Decoding for Joint Information Extraction (2021.naacl-main)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (IE) and Information Extraction (IE), both focus on extracting the main information from natural language texts. |
| Approach: | They propose an AMR-guided framework for joint information extraction using a pre-trained AMR parser. |
| Outcome: | The proposed framework achieves state-of-the-art on all IE subtasks. |
Graph-based Dependency Parsing with Graph Neural Networks (P19-1)
Copied to clipboard
| Challenge: | In graph-based dependency parsers, learning representations is gaining in importance, and we use graph neural networks to learn the representations. |
| Approach: | They propose to use graph neural networks to learn dependency tree nodes and propose to add a new aggregation function to the system. |
| Outcome: | The proposed model achieves the best UAS and LAS on PTB (96.0%, 94.3%) without using external resources. |
A Survey of AMR Applications (2024.emnlp-main)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) is a semantic representation that takes the form of a rooted, directed graph. |
| Approach: | They analyze more than 100 papers which use Abstract Meaning Representation (AMR) they highlight the range of applications for which AMR has been harnessed and techniques for incorporating it . they also highlight broader AMR engineering patterns and outline areas of future work that seem ripe for AMR incorporation. |
| Outcome: | The results highlight the range of applications for which AMR has been harnessed and the techniques for incorporating it into those applications. |
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. |