Papers › Semi-Supervised Semantic Dependency Parsing Using CRF Autoencoders

Semi-Supervised Semantic Dependency Parsing Using CRF Autoencoders

1 Jul 2020ACL 2020 6archive 2025-07-28

Zixia Jia, Youmi Ma, Jiong Cai, Kewei Tu

Semantic dependency parsing, which aims to find rich bi-lexical relationships, allows words to have multiple dependency heads, resulting in graph-structured representations. We propose an approach to semi-supervised learning of semantic dependency parsers based on the CRF autoencoder framework. Our encoder is a discriminative neural semantic dependency parser that predicts the latent parse graph of the input sentence. Our decoder is a generative neural model that reconstructs the input sentence conditioned on the latent parse graph. Our model is arc-factored and therefore parsing and learning are both tractable. Experiments show our model achieves significant and consistent improvement over the supervised baseline.

PaperPDFCode

Code

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

ARCDecoderDependency ParsingSemantic Dependency ParsingSentence

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

CRF

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections