Dependency Parsing with the Structuralized Prompt Template

Keunha Kim, Youngjoong Ko
2/24/2025
cs.CL

No confident code implementation found for this paper.

Abstract

Dependency parsing is a fundamental task in natural language processing (NLP), aiming to identify syntactic dependencies and construct a syntactic tree for a given sentence. Traditional dependency parsing models typically construct embeddings and utilize additional layers for prediction. We propose a novel dependency parsing method that relies solely on an encoder model with a text-to-text training approach. To facilitate this, we introduce a structured prompt template that effectively captures the structural information of dependency trees. Our experimental results demonstrate that the proposed method achieves outstanding performance compared to traditional models, despite relying solely on a pre-trained model. Furthermore, this method is highly adaptable to various pre-trained models across different target languages and training environments, allowing easy integration of task-specific features.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kim2025dependency,
  title  = {Dependency Parsing with the Structuralized Prompt Template},
  author = {Keunha Kim and Youngjoong Ko},
  year   = {2025},
  eprint = {2502.16919},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2502.16919v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.16919.svg)](https://codeofpaper.com/paper/2502.16919)

Discussion