Step-by-step Instructions and a Simple Tabular Output Format Improve the Dependency Parsing Accuracy of LLMs
Matsuda, Hiroshi, Ma, Chunpeng, Asahara, Masayuki
–arXiv.org Artificial Intelligence
Recent advances in large language models (LLMs) have enabled impressive performance in various tasks. However, standard prompting often struggles to produce structurally valid and accurate outputs, especially in dependency parsing. We propose a novel step-by-step instruction strategy, where universal part-of-speech tagging precedes the prediction of syntactic heads and dependency labels, and a simplified CoNLL-U like output format, our method achieves state-of-the-art accuracy on Universal Dependencies datasets across 17 languages without hallucination or contamination. We further show that multilingual fine-tuning simultaneously improves cross-language generalization performance. Our results highlight the effectiveness of explicit reasoning steps in LLM-based parsing and offer a scalable, format-consistent alternative to bracket-based approaches.
arXiv.org Artificial Intelligence
Jun-17-2025
- Country:
- Asia
- China > Beijing
- Beijing (0.04)
- Japan > Honshū
- Kantō > Tokyo Metropolis Prefecture > Tokyo (0.04)
- Middle East > UAE
- Abu Dhabi Emirate > Abu Dhabi (0.14)
- China > Beijing
- Europe
- Belgium > Brussels-Capital Region
- Brussels (0.04)
- Hungary > Csongrád-Csanád County
- Szeged (0.04)
- Belgium > Brussels-Capital Region
- North America
- Canada > Ontario
- Toronto (0.04)
- United States
- New Mexico > Santa Fe County
- Santa Fe (0.04)
- Texas > Lavaca County (0.04)
- New Mexico > Santa Fe County
- Canada > Ontario
- Asia
- Genre:
- Research Report > New Finding (0.48)
- Industry:
- Information Technology (0.68)
- Technology: