Papers with PSD
Preposition Sense Disambiguation and Representation (D18-1)
Copied to clipboard
| Challenge: | Prepositions are highly polysemous and their variegated senses encode significant semantic information. |
| Approach: | They match each preposition’s context and their interplay to the geometry of the word vectors to the left and right of the preposition. |
| Outcome: | The proposed algorithm is comparable to and better than state-of-the-art on two benchmark 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. |
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. |
Double: Breaking the Acceleration Limit via Double Retrieval Speculative Parallelism (2026.acl-long)
Copied to clipboard
| Challenge: | Parallel Speculative Decoding (PSD) has limitations due to speedup limits and high computational waste . a novel synchronous mechanism solves the Retrieval Precision-Efficiency Dilemma . |
| Approach: | They propose a framework that combines a draft-verification-based approach with a synchronous mechanism to solve the Retrieval Precision-Efficiency Dilemma. |
| Outcome: | The proposed framework breaks speedup limits for Speculative Decoding by overlapping draft generation with verification. |