Papers with SDP
Multitask Parsing Across Semantic Representations (P18-1)
Copied to clipboard
| 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. |
Structure Regularized Neural Network for Entity Relation Classification for Chinese Literature Text (N18-2)
Copied to clipboard
| Challenge: | Existing methods for relation classification have been used in natural language processing. |
| Approach: | They propose a relation classification task for Chinese literature text using a new dataset. |
| Outcome: | The proposed model outperforms the state-of-the-art methods on Chinese literature text. |
Chinese Relation Classification using Long Short Term Memory Networks (L18-1)
Copied to clipboard
| Challenge: | Relation classification is the task to predict semantic relations between pairs of entities in a given text. |
| Approach: | They propose to extract relations between entities in Chinese text using a long-term memory network. |
| Outcome: | The proposed system achieves state-of-the-art F-measure on ACE 2005 corpus . it predicts relations between head entity e h and tail entity t from sentence . |
Shallow Discourse Parsing for Under-Resourced Languages: Combining Machine Translation and Annotation Projection (2020.lrec-1)
Copied to clipboard
| Challenge: | Shallow Discourse Parsing (SDP) relies on large amounts of training data, which so far exists only for English. |
| Approach: | They propose to translate an existing English Penn Discourse TreeBank into German and use it to create a German corpus annotated for shallow discourse relations in the news domain. |
| Outcome: | The proposed corpus is annotated for shallow discourse relations in the (financial) news domain. |
Auxiliary tasks to boost Biaffine Semantic Dependency Parsing (2022.findings-acl)
Copied to clipboard
| Challenge: | Semantic dependency parsing (SDP) is a task of producing a dependency graph for a sentence. |
| Approach: | They propose to use simple auxiliary tasks that introduce some form of interdependence between arcs to circumvent such an independence of decision. |
| Outcome: | The proposed method shows modest but systematic performance gains on a near-state-of-the-art baseline using transformer-based contextualized representations. |
Dependency-aware Prototype Learning for Few-shot Relation Classification (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods for few-shot relation classification fail to distinguish multiple relations that co-exist in one sentence. |
| Approach: | They propose a dependency-aware prototype learning method for few-shot relation classification . they utilize dependency trees and shortest dependency paths as structural information . |
| Outcome: | The proposed method achieves better performance than baselines on the FewRel dataset. |
Multi-Task Semantic Dependency Parsing with Policy Gradient for Learning Easy-First Strategies (P19-1)
Copied to clipboard
| Challenge: | Existing dependency parsing algorithms do not support directed acyclic graphs . a a systole-based dependency parses sentences using binary semantic relations that are not trees . |
| Approach: | They propose an iterative predicate selection algorithm for semantic dependency parsing . they train the algorithm using multi-task learning and task-specific policy gradient training . |
| Outcome: | The proposed model achieves a new state of the art on the SemEval 2015 task 18 dataset . |
Semantics as a Foreign Language (D18-1)
Copied to clipboard
| Challenge: | (2017): Syntactic grammars capture propositions, but graph-based representations aim to capture a wider notion of propositions. |
| Approach: | They propose a neural sequence-to-sequence framework which can recover syntactic linearizations by a sequence-based approach. |
| Outcome: | The proposed framework performs almost on-par with previous state-of-the-art approaches while requiring less parallel training annotations. |
A Richer-but-Smarter Shortest Dependency Path with Attentive Augmentation for Relation Extraction (N19-1)
Copied to clipboard
| Challenge: | Existing approaches to extract relationship between entities in sentences suffer from missing or redundant information. |
| Approach: | They propose a deep neural model that combines the advantages of the two approaches to extract the relationship between two entities in a sentence. |
| Outcome: | The proposed model outperforms baseline models on the SemEval-2010 dataset. |
ACT2: A multi-disciplinary semi-structured dataset for importance and purpose classification of citations (2022.lrec-1)
Copied to clipboard
| Challenge: | Existing methods for classifying citations rely on bibliometric measures to consider the semantics of citation. |
| Approach: | They propose to use a Citation Context Classification (3C) shared task dataset to classify citations according to their purpose and importance. |
| Outcome: | The proposed model can be used to link research works to graphs and enable efficient knowledge discovery. |
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. |
Just Fine-tune Twice: Selective Differential Privacy for Large Language Models (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to protect language models from privacy leakage suffer from limited user control and low utility . et al., 2018: a novel framework that achieves SDP for state-of-the-art large transformer-based models. |
| Approach: | They propose a framework that applies differential privacy to large language models . they use redacted in-domain data to fine-tune the model with original in- domain data . |
| Outcome: | The proposed framework achieves strong utility compared to baselines. |
Few-Shot Semantic Dependency Parsing via Graph Contrastive Learning (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing graph neural networks (GNNs) have shown promising performance on semantic dependency parsing (SDP) training a high-performing model requires a large amount of labeled data and it is prone to over-fitting in the absence of sufficient labele . |
| Approach: | They propose a syntax-guided graph contrastive learning framework to train GNNs with unlabeled data and fine-tune pre-trained GNN models with few-shot labeled SDP data. |
| Outcome: | The proposed framework achieves promising results when few-shot training samples are available. |
SIV-Bench: A Video Benchmark for Social Interaction Understanding and Reasoning (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing benchmarks for Multimodal Large Language Models (MLLMs) have been lacking due to the rich nature of social interaction. |
| Approach: | They propose a video benchmark to evaluate MLLMs' capabilities across social scene understanding, social state reasoning, and social dynamics prediction. |
| Outcome: | The proposed benchmarks evaluate MLLMs' capabilities across social scene understanding, social state reasoning, and social dynamics prediction tasks. |