| Challenge: | Existing work on graph-structured annotation conversions has focused on feature-based models which are not easily applicable to new conversions. |
| Approach: | They propose two graph-to-graph conversion approaches which use pseudo data and inherit parameters to guide conversions respectively. |
| Outcome: | The proposed approaches outperform strong baselines with higher conversion score on a graph-structured dataset and other datasets. |
Similar Papers
Graph-to-Graph Transformer for Transition-based Dependency Parsing (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing models for conditioning on graphs and predicting graphs are weak, but they are effective for transition-based dependency parsing. |
| Approach: | They propose a Transformer architecture for conditioning on and predicting arbitrary graphs. |
| Outcome: | The proposed architecture outperforms the state-of-the-art in transition-based dependency parsing on English Penn Treebank and 13 languages of Universal Dependencies Treebanks. |
Dependency Graph Parsing as Sequence Labeling (2024.emnlp-main)
Copied to clipboard
| Challenge: | Various linearizations have been proposed to cast syntactic dependency parsing as sequence labeling, but they cannot handle reentrancy or cycles. |
| Approach: | They propose unbounded linearizations that can be used to cast dependency parsing as sequence labeling. |
| Outcome: | The proposed linearizations can cast syntactic dependency parsing as a sequence labeling task. |
Cheating a Parser to Death: Data-driven Cross-Treebank Annotation Transfer (L18-1)
Copied to clipboard
| Challenge: | Using annotated corpus for linguistic purposes is no longer justified . hand-crafted syntactic resources such as grammars and lexicons can be used as sources of features to guide data driven systems. |
| Approach: | They propose an efficient method for transferring annotations between two different treebanks of the same language. |
| Outcome: | The proposed method is based on the Universal Dependency annotation scheme and was evaluated on the gold standard (94.75% of LAS, 99.40% UAS on the test set). |
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. |
Graph-to-Sequence Learning using Gated Graph Neural Networks (P18-1)
Copied to clipboard
| Challenge: | Existing approaches to graph-to-sequence learning ignore the full graph structure, discarding key information. |
| Approach: | They propose a graph-to-sequence learning model that encodes the full graph structure and an input transformation that allows nodes and edges to have their own hidden representations. |
| Outcome: | The proposed model outperforms baselines in generation from AMR graphs and syntax-based neural machine translation while retaining the full graph structure. |
Heterogeneous Graph Transformer for Graph-to-Sequence Learning (2020.acl-main)
Copied to clipboard
| Challenge: | Recent studies ignore the indirect relations between distance nodes, or treat indirect relations and direct relations in the same way. |
| Approach: | They propose a graph-to-sequence (Graph2Seq) encoder which models graph structure to model different relations in individual subgraphs of the original graph. |
| Outcome: | The proposed model outperforms the state-of-the-art on all four benchmarks of AMR-to-text generation and syntax-based neural machine translation. |
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. |
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. |
Hierarchical Bracketing Encodings Work for Dependency Graphs (2025.emnlp-main)
Copied to clipboard
| Challenge: | Sequence labeling (SL) is a simple yet effective paradigm for a wide range of natural language problems. |
| Approach: | They propose a new bracketing approach for dependency graph parsing that encodes graphs as sequences and n tagging actions. |
| Outcome: | The proposed approach significantly reduces label space while preserving structural information. |
Structural Neural Encoders for AMR-to-text Generation (N19-1)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) graphs are graphs, rather than trees, because they contain reentrant nodes with multiple parents. |
| Approach: | They propose to use sequence-to-sequence models that encode AMR graphs into vector representations to generate sentences from AMRs. |
| Outcome: | The proposed model outperforms tree encoders in the AMR-to-text generation task by 24.40 points. |