A Graph-Based Neural Model for End-to-End Frame Semantic Parsing (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies focus on frame semantic parsing as a graph construction problem. |
| Approach: | They propose an end-to-end neural model to tackle frame semantic parsing jointly. |
| Outcome: | The proposed model is highly competitive and performs better than pipeline models on two benchmark datasets. |
Similar Papers
Sequence-to-Action: End-to-End Semantic Graph Generation for Semantic Parsing (P18-1)
Copied to clipboard
| Challenge: | Existing methods for semantic parsing are difficult to design and learn, especially in wideopen domains. |
| Approach: | They propose a neural semantic parsing approach which models semantic par- sing as an end-to-end semantic graph generation process. |
| Outcome: | The proposed model achieves state-of-the-art performance on Overnight dataset and gets competitive performance on Geo and Atis datasets. |
Graph-Based Decoding for Task Oriented Semantic Parsing (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing paradigms for semantic parsing are sequence-to-sequence and AMR parsers. |
| Approach: | They propose to formulate parsing as a sequence-to-sequence task using graph-based decoding techniques developed for syntactic parsers. |
| Outcome: | The proposed approach is competitive with sequence decoders on the standard setting and offers significant improvements in data efficiency and data availability. |
Fast and Accurate End-to-End Span-based Semantic Role Labeling as Word-based Graph Parsing (2022.coling-1)
Copied to clipboard
| Challenge: | Using end-to-end span-based SRL, we propose a word-based graph parsing task for word-level representation of spans . compared with word-driven SRL, span-Based SRL is more complex due to difficulties in determining argument boundaries. |
| Approach: | They propose to cast end-to-end span-based SRL as a word-based graph parsing task . they propose a constrained Viterbi procedure to ensure the legality of the output graph . |
| Outcome: | The proposed model can parse 669/252 sentences per second without and with pre-trained models. |
Second-Order Neural Dependency Parsing with Message Passing and End-to-End Training (2020.aacl-main)
Copied to clipboard
| Challenge: | Existing approaches to dependency parsing use exact and approximate inference to find the best parse tree. |
| Approach: | They propose a second-order graph-based neural dependency parsing approach using message passing and end-to-end neural networks. |
| Outcome: | The proposed methods match the state-of-the-art second-order graph-based neural dependency parsers and have significantly faster speed in training and testing. |
End-to-End Graph-Based TAG Parsing with Neural Networks (N18-1)
Copied to clipboard
| Challenge: | Using BiLSTMs, highway connections, and character-level CNNs, we propose a graph-based Tree Adjoining Grammar (TAG) parser. |
| Approach: | They propose a graph-based Tree Adjoining Grammar parser that uses BiLSTMs, highway connections, and character-level CNNs. |
| Outcome: | The proposed parser outperforms the previously reported best by more than 2.2 LAS and UAS points. |
Exploiting Rich Syntactic Information for Semantic Parsing with Graph-to-Sequence Model (D18-1)
Copied to clipboard
| Challenge: | Existing neural semantic parsers extract word order features while neglecting other valuable syntactic information. |
| Approach: | They propose to use syntactic graph to represent three types of syntaktic information . they then employ a graph-to-sequence model to encode the syntastic graph and decode a logical form . |
| Outcome: | The proposed model is comparable to the state-of-the-art on Jobs640, ATIS, and Geo880. |
Graph-to-Tree Neural Networks for Learning Structured Input-Output Translation with Applications to Semantic Parsing and Math Word Problem (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Graph2Tree model encodes graph-structured input and decodes tree-structures output. |
| Approach: | They propose a novel Graph-to-Tree Neural Network consisting of a graph encoder and a hierarchical tree decoder that encodes an augmented graph-structured input and decodes a tree-structure-output. |
| Outcome: | The proposed model outperforms or matches the performance of other state-of-the-art models on two problems, neural semantic parsing and math word problem. |
A Double-Graph Based Framework for Frame Semantic Parsing (2022.naacl-main)
Copied to clipboard
| Challenge: | Frame semantic parsing is a fundamental NLP task, which consists of three subtasks: frame identification, argument identification and role classification. |
| Approach: | They propose a frame semantic parser with a double-graph to derive knowledge-enhanced representations for frames and FEs. |
| Outcome: | The proposed method outperforms the state-of-the-art method by up to 1.7 F1-score on two FrameNet datasets. |
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. |
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. |