Dependency Language Models for Transition-based Dependency Parsing
원문 초록
In this paper, we present an approach to improve the accuracy of a strong transition-based dependency parser by exploiting dependency language models that are extracted from a large parsed corpus. We integrated a small number of features based on the dependency language models 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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Algorithms for Weighted Pushdown Automata
Graph-to-Graph Transformer for Transition-based Dependency Parsing
Structured Sentiment Analysis as Transition-based Dependency Parsing
Greedy Transition-Based Dependency Parsing with Discrete and Continuous Supertag Features
Transition-Based Dependency Parsing using Perceptron Learner
Vietnamese transition-based dependency parsing with supertag features
토론
이 논문과 연결된 포럼 글이 아직 없습니다.