Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Dependency Language Models for Transition-based Dependency Parsing (1607.04982v2)

Published 18 Jul 2016 in cs.CL

Abstract: In this paper, we present an approach to improve the accuracy of a strong transition-based dependency parser by exploiting dependency LLMs that are extracted from a large parsed corpus. We integrated a small number of features based on the dependency LLMs into the parser. To demonstrate the effectiveness of the proposed approach, we evaluate our parser on standard English and Chinese data where the base parser could achieve competitive accuracy scores. Our enhanced parser achieved state-of-the-art accuracy on Chinese data and competitive results on English data. We gained a large absolute improvement of one point (UAS) on Chinese and 0.5 points for English.

Citations (3)

Summary

We haven't generated a summary for this paper yet.