| Challenge: | Recent studies have focused on parsing structured knowledge graphs from textual descriptions. |
| Approach: | They propose an alternative but equivalent scene graph representation that connects to dependency parses. |
| Outcome: | The proposed model outperforms best approaches on image retrieval applications. |
Similar Papers
On the Role of Scene Graphs in Image Captioning (D19-64)
Copied to clipboard
| Challenge: | Recent captioning approaches rely on ad-hoc approaches to obtain graphs for images, but they introduce noise and it is unclear the effect of parser errors on captioning accuracy. |
| Approach: | They investigate whether scene graphs can help image captioning . they show that a scene graph parser can boost performance almost as much as ground truth graphs . |
| Outcome: | The proposed parser can boost performance almost as much as ground truth graphs . |
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. |
FACTUAL: A Benchmark for Faithful and Consistent Textual Scene Graph Parsing (2023.findings-acl)
Copied to clipboard
Zhuang Li, Yuyang Chai, Terry Yue Zhuo, Lizhen Qu, Gholamreza Haffari, Fei Li, Donghong Ji, Quan Hung Tran
| Challenge: | Existing parsers that convert image captions into scene graphs often suffer from errors and inconsistency. |
| Approach: | They propose a dataset that re-annotates image captions using a new intermediate representation called FACTUAL-MR and a metric to measure scene graph similarity. |
| Outcome: | The proposed parser outperforms existing parsers in terms of faithfulness and consistency on multiple benchmark 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. |
Coarse-to-Fine Contrastive Learning in Image-Text-Graph Space for Improved Vision-Language Compositionality (2023.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies have highlighted severe limitations of contrastive learning models in their ability to perform compositional reasoning over objects, attributes, and relations. |
| Approach: | They propose a graph decomposition framework and negative mining techniques to improve attribute binding and relation understanding of scene graphs. |
| Outcome: | The proposed approach improves attribute binding, relation understanding, generalization, and productivity on multiple benchmarks. |
Deep Contextualized Word Embeddings in Transition-Based and Graph-Based Dependency Parsing - A Tale of Two Parsers Revisited (D19-1)
Copied to clipboard
| Challenge: | In recent years, dependency parsing has shifted from discrete features to neural networks and continuous representations. |
| Approach: | They propose to use deep contextualized word embeddings to pack information about global sentence structure into local feature representations to make the two approaches virtually equivalent in terms of accuracy and error profile. |
| Outcome: | The proposed model improves the accuracy and error profile of transition-based and graph-based dependency parsers on 13 languages. |
Simpler but More Accurate Semantic Dependency Parsing (P18-2)
Copied to clipboard
| Challenge: | Syntactic dependency parsing is the most popular method for automatically extracting low-level relationships between words in a sentence. |
| Approach: | They extend a syntactic dependency parser to train on and generate graph-structured representations that capture between-word relationships that are more closely related to the meaning of a sentence. |
| Outcome: | The proposed system beats the current state-of-the-art system by 0.6% and linguistically richer representations push the margin even higher. |
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. |
Scaling Graph-Based Dependency Parsing with Arc Vectorization and Attention-Based Refinement (2025.naacl-short)
Copied to clipboard
| Challenge: | Existing graph-based dependency parsers use a standard two-pipeline approach that only scores arcs and labels . |
| Approach: | They propose a graph-based dependency parsing architecture that explicitly constructs vectors from which both arcs and labels are scored. |
| Outcome: | The proposed model outperforms state-of-the-art models on PTB and UD in accuracy and efficiency. |
Dependency parsing with structure preserving embeddings (2021.eacl-main)
Copied to clipboard
| Challenge: | Modern neural approaches to dependency parsing are trained to predict a tree structure by learning a contextual representation for tokens in a sentence and a head–dependent scoring function. |
| Approach: | They propose to combine a contextual representation for tokens and a head–dependent scoring function to learn interpretable representations by training a parser to explicitly preserve structural properties of a tree. |
| Outcome: | The proposed approach yields strong tree distance preservation and parsing performance on par with a competitive graph-based parser. |