Discontinuous Constituent Parsing as Sequence Labeling

• URL: http://arxiv.org/abs/2010.00633v1
• Date: Thu, 1 Oct 2020 18:17:58 GMT
• Title: Discontinuous Constituent Parsing as Sequence Labeling
• Abstract summary: It shows that existing reductions for constituent parsing as labeling do not support discontinuities. It proposes to encode tree discontinuities as nearly ordered permutations of the input sequence.
• Score: 12.234169944475537
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper reduces discontinuous parsing to sequence labeling. It first shows that existing reductions for constituent parsing as labeling do not support discontinuities. Second, it fills this gap and proposes to encode tree discontinuities as nearly ordered permutations of the input sequence. Third, it studies whether such discontinuous representations are learnable. The experiments show that despite the architectural simplicity, under the right representation, the models are fast and accurate.

Related papers

• Non-binary bottom-up constituency parsing without arity actions [8.373441227262644]
  We show that this arity parameter is not a necessary transition primitive.<n>We show that its predicted arity profile remains close to the gold treebanks and that high-arity constituents do not collapse when arity actions are removed.
  arXiv  Detail & Related papers  (2026-07-12T06:07:29Z)
• Token-to-Token Alignment of Text Embeddings for Semantic Blending [55.88554156801394]
  We introduce Token-to-Token alignment, a framework that establishes explicit semantic correspondence between tokens across prompts.<n>Our results show that text embedding spaces in text-to-image models implicitly encode a continuous semantic structure that becomes accessible once representations are properly aligned.
  arXiv  Detail & Related papers  (2026-06-22T23:54:40Z)
• A fast and sound tagging method for discontinuous named-entity recognition [8.48487186427764]
  We introduce a novel tagging scheme for discontinuous named entity recognition. We rely on a weighted finite state automaton for both marginal and maximum a posteriori inference. We evaluate our approach on three English datasets in the biomedical domain.
  arXiv  Detail & Related papers  (2024-09-24T17:07:45Z)
• BEST: BERT Pre-Training for Sign Language Recognition with Coupling Tokenization [135.73436686653315]
  We are dedicated to leveraging the BERT pre-training success and modeling the domain-specific statistics to fertilize the sign language recognition( SLR) model. Considering the dominance of hand and body in sign language expression, we organize them as pose triplet units and feed them into the Transformer backbone. Pre-training is performed via reconstructing the masked triplet unit from the corrupted input sequence. It adaptively extracts the discrete pseudo label from the pose triplet unit, which represents the semantic gesture/body state.
  arXiv  Detail & Related papers  (2023-02-10T06:23:44Z)
• Timestamp-Supervised Action Segmentation from the Perspective of Clustering [12.661218632080207]
  Most existing methods generate pseudo-labels for all frames in each video to train the segmentation model. We propose a novel framework from the perspective of clustering, which includes the following two parts. iterative clustering iteratively propagates the pseudo-labels to the ambiguous intervals by clustering, and thus updates the pseudo-label sequences to train the model.
  arXiv  Detail & Related papers  (2022-12-22T13:35:00Z)
• Exploiting Completeness and Uncertainty of Pseudo Labels for Weakly Supervised Video Anomaly Detection [149.23913018423022]
  Weakly supervised video anomaly detection aims to identify abnormal events in videos using only video-level labels. Two-stage self-training methods have achieved significant improvements by self-generating pseudo labels. We propose an enhancement framework by exploiting completeness and uncertainty properties for effective self-training.
  arXiv  Detail & Related papers  (2022-12-08T05:53:53Z)
• Accelerating BERT Inference for Sequence Labeling via Early-Exit [65.7292767360083]
  We extend the recent successful early-exit mechanism to accelerate the inference of PTMs for sequence labeling tasks. We also propose a token-level early-exit mechanism that allows partial tokens to exit early at different layers. Our approach can save up to 66%-75% inference cost with minimal performance degradation.
  arXiv  Detail & Related papers  (2021-05-28T14:39:26Z)
• Reducing Discontinuous to Continuous Parsing with Pointer Network Reordering [0.7412445894287709]
  A discontinuous tree can be converted into a continuous variant by reordering tokens. We develop a Pointer Network capable of accurately generating the continuous token arrangement for a given input sentence.
  arXiv  Detail & Related papers  (2021-04-13T14:32:59Z)
• Uncertainty-Aware Label Refinement for Sequence Labeling [47.67853514765981]
  We introduce a novel two-stage label decoding framework to model long-term label dependencies. A base model first predicts draft labels, and then a novel two-stream self-attention model makes refinements on these draft predictions.
  arXiv  Detail & Related papers  (2020-12-19T06:56:59Z)
• Compositional Generalization via Semantic Tagging [81.24269148865555]
  We propose a new decoding framework that preserves the expressivity and generality of sequence-to-sequence models. We show that the proposed approach consistently improves compositional generalization across model architectures, domains, and semantic formalisms.
  arXiv  Detail & Related papers  (2020-10-22T15:55:15Z)
• Semantic Label Smoothing for Sequence to Sequence Problems [54.758974840974425]
  We propose a technique that smooths over emphwell formed relevant sequences that have sufficient n-gram overlap with the target sequence. Our method shows a consistent and significant improvement over the state-of-the-art techniques on different datasets.
  arXiv  Detail & Related papers  (2020-10-15T00:31:15Z)

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.