Dependency Parsing with the Structuralized Prompt Template
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.
Code (0)
등록된 구현이 없습니다.
Tasks
Dependency ParsingSentenceSimilar Papers 제목 키워드 기반
Template Kernels for Dependency Parsing
Joint POS Tagging and Dependency Parsing with Transition-based Neural Networks
While part-of-speech (POS) tagging and dependency parsing are observed to be closely related, existing work on joint modeling with manually crafted feature templates suffers from the feature sparsity and incompleteness p…
Dependency ParsingPart-Of-Speech TaggingPOSPOS TaggingA Joint Model for Graph-based Chinese Dependency Parsing
In Chinese dependency parsing, the joint model of word segmentation, POS tagging and dependency parsing has become the mainstream framework because it can eliminate error propagation and share knowledge, where the transi…
Chinese Dependency ParsingChinese Word SegmentationDependency ParsingPOS+3ASPIRO: Any-shot Structured Parsing-error-Induced ReprOmpting for Consistent Data-to-Text Generation
We present ASPIRO, an approach for structured data verbalisation into short template sentences in zero to few-shot settings. Unlike previous methods, our approach prompts large language models (LLMs) to directly produce …
Data-to-Text GenerationText GenerationSpeeding Up Natural Language Parsing by Reusing Partial Results
This paper proposes a novel technique that applies case-based reasoning in order to generate templates for reusable parse tree fragments, based on PoS tags of bigrams and trigrams that demonstrate low variability in thei…
POS