Pith. sign in

REVIEW 1 cited by

Fast Rule-Based Decoding: Revisiting Syntactic Rules in Neural Constituency Parsing

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2212.08458 v1 pith:WDGZ6U24 submitted 2022-12-16 cs.CL cs.AIcs.LG

classification cs.CLcs.AIcs.LG
keywords syntacticconstituencydecodingneuralparsingrulesfastprevious
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Most recent studies on neural constituency parsing focus on encoder structures, while few developments are devoted to decoders. Previous research has demonstrated that probabilistic statistical methods based on syntactic rules are particularly effective in constituency parsing, whereas syntactic rules are not used during the training of neural models in prior work probably due to their enormous computation requirements. In this paper, we first implement a fast CKY decoding procedure harnessing GPU acceleration, based on which we further derive a syntactic rule-based (rule-constrained) CKY decoding. In the experiments, our method obtains 95.89 and 92.52 F1 on the datasets of PTB and CTB respectively, which shows significant improvements compared with previous approaches. Besides, our parser achieves strong and competitive cross-domain performance in zero-shot settings.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Contrastive Learning on LLM Back Generation Treebank for Cross-domain Constituency Parsing

    cs.CL 2025-05 conditional novelty 6.0 of 10

    An LLM fills masked constituency trees to create a synthetic domain treebank, and span-level contrastive pre-training on it gives a new SOTA average F1 of 88.52 on cross-domain parsing.

Pith tools