Combining (second-order) graph-based and headed span-based projective dependency parsing

• URL: http://arxiv.org/abs/2108.05838v1
• Date: Thu, 12 Aug 2021 16:42:00 GMT
• Title: Combining (second-order) graph-based and headed span-based projective dependency parsing
• Authors: Songlin Yang, Kewei Tu
• Abstract summary: citetyang2021headed propose a headed span-based method. Both of them score all possible trees and globally find the highest-scoring tree. In this paper, we combine these two kinds of methods, designing several dynamic programming algorithms for joint inference.
• Score: 24.337440797369702
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Graph-based methods are popular in dependency parsing for decades. Recently, \citet{yang2021headed} propose a headed span-based method. Both of them score all possible trees and globally find the highest-scoring tree. In this paper, we combine these two kinds of methods, designing several dynamic programming algorithms for joint inference. Experiments show the effectiveness of our proposed methods\footnote{Our code is publicly available at \url{https://github.com/sustcsonglin/span-based-dependency-parsing}.}.

Related papers

• An Autoregressive Text-to-Graph Framework for Joint Entity and Relation Extraction [4.194768796374315]
  We propose a novel method for joint entity and relation extraction from unstructured text by framing it as a conditional sequence generation problem. It generates a linearized graph where nodes represent text spans and edges represent relation triplets. Our method employs a transformer encoder-decoder architecture with pointing mechanism on a dynamic vocabulary of spans and relation types.
  arXiv  Detail & Related papers  (2024-01-02T18:32:14Z)
• From Cluster Assumption to Graph Convolution: Graph-based Semi-Supervised Learning Revisited [51.24526202984846]
  Graph-based semi-supervised learning (GSSL) has long been a hot research topic. graph convolutional networks (GCNs) have become the predominant techniques for their promising performance.
  arXiv  Detail & Related papers  (2023-09-24T10:10:21Z)
• Hierarchical Multi-Instance Multi-Label Learning for Detecting Propaganda Techniques [12.483639681339767]
  We propose a simple RoBERTa-based model for classifying all spans in an article simultaneously. We incorporate hierarchical label dependencies by adding an auxiliary classifier for each node in the decision tree. Our model leads to an absolute improvement of 2.47% micro-F1 over the model from the shared task winning team in a cross-validation setup.
  arXiv  Detail & Related papers  (2023-05-30T21:23:19Z)
• SoftTreeMax: Policy Gradient with Tree Search [72.9513807133171]
  We introduce SoftTreeMax, the first approach that integrates tree-search into policy gradient. On Atari, SoftTreeMax demonstrates up to 5x better performance in faster run-time compared with distributed PPO.
  arXiv  Detail & Related papers  (2022-09-28T09:55:47Z)
• Joint Graph Learning and Matching for Semantic Feature Correspondence [69.71998282148762]
  We propose a joint emphgraph learning and matching network, named GLAM, to explore reliable graph structures for boosting graph matching. The proposed method is evaluated on three popular visual matching benchmarks (Pascal VOC, Willow Object and SPair-71k) It outperforms previous state-of-the-art graph matching methods by significant margins on all benchmarks.
  arXiv  Detail & Related papers  (2021-09-01T08:24:02Z)
• Headed Span-Based Projective Dependency Parsing [24.337440797369702]
  We propose a headed span-based method for projective dependency parsing. We use neural networks to score headed spans and design a novel $O(n3)$ dynamic programming algorithm to enable global training and exact inference.
  arXiv  Detail & Related papers  (2021-08-10T15:27:47Z)
• Dependency Parsing as MRC-based Span-Span Prediction [29.956515394820673]
  Higher-order methods for dependency parsing can partially but not fully address the issue that edges in dependency tree should be constructed at the text span/subtree level rather than word level. We propose a new method for dependency parsing to address this issue.
  arXiv  Detail & Related papers  (2021-05-17T08:03:48Z)
• Learnable Graph Matching: Incorporating Graph Partitioning with Deep Feature Learning for Multiple Object Tracking [58.30147362745852]
  Data association across frames is at the core of Multiple Object Tracking (MOT) task. Existing methods mostly ignore the context information among tracklets and intra-frame detections. We propose a novel learnable graph matching method to address these issues.
  arXiv  Detail & Related papers  (2021-03-30T08:58:45Z)
• Span-based Semantic Parsing for Compositional Generalization [53.24255235340056]
  SpanBasedSP predicts a span tree over an input utterance, explicitly encoding how partial programs compose over spans in the input. On GeoQuery, SCAN and CLOSURE, SpanBasedSP performs similarly to strong seq2seq baselines on random splits, but dramatically improves performance compared to baselines on splits that require compositional generalization.
  arXiv  Detail & Related papers  (2020-09-13T16:42:18Z)
• Modeling Graph Structure via Relative Position for Text Generation from Knowledge Graphs [54.176285420428776]
  We present Graformer, a novel Transformer-based encoder-decoder architecture for graph-to-text generation. With our novel graph self-attention, the encoding of a node relies on all nodes in the input graph - not only direct neighbors - facilitating the detection of global patterns. Graformer learns to weight these node-node relations differently for different attention heads, thus virtually learning differently connected views of the input graph.
  arXiv  Detail & Related papers  (2020-06-16T15:20:04Z)
• Universal Function Approximation on Graphs [0.0]
  We produce a framework for constructing universal function approximators on graph isomorphism classes. We show how this allows us to achieve state-of-the-art performance on four different well-known datasets.
  arXiv  Detail & Related papers  (2020-03-14T21:12:33Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.