Semi-supervised Autoencoding Projective Dependency Parsing
원문 초록
We describe two end-to-end autoencoding models for semi-supervised graph-based projective dependency parsing. The first model is a Locally Autoencoding Parser (LAP) encoding the input using continuous latent variables in a sequential manner; The second model is a Globally Autoencoding Parser (GAP) encoding the input into dependency trees as latent variables, with exact inference. Both models consist of two parts: an encoder enhanced by deep neural networks (DNN) that can utilize the contextual information to encode the input into latent variables, and a decoder which is a generative model able to reconstruct the input. Both LAP and GAP admit a unified structure with different loss functions for labeled and unlabeled data with shared parameters. We conducted experiments on WSJ and UD dependency parsing data sets, showing that our models can exploit the unlabeled data to improve the performance given a limited amount of labeled data, and outperform a previously proposed semi-supervised model.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Prague Dependency Treebank -- Consolidated 2.0: Enriching a Complex Annotation Scheme
Meet UD_Czech-PDTC: A Large and Genre-Rich Treebank in Universal Dependencies
Adaptive Visual KV Cache Reuse for Efficient Multi-Turn Iterative Multimodal Reasoning
PACE-dLLM: 확산 언어 모델을 위한 신뢰도 절벽 추정 기반 탄력적 블록 디코딩
PACE-dLLM: Elastic Block Decoding via Confidence Cliff Estimation for Diffusion Language Models
TACG: 확산 언어 모델 디코딩을 위한 궤적 인식 커밋 게이팅
TACG: Trajectory-Aware Commit Gating for Diffusion Language Model Decoding
SpanUQ: 대규모 언어 모델 생성을 위한 스팬 수준 불확실성 정량화
SpanUQ: Span-Level Uncertainty Quantification for Large Language Model Generation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.