arXiv:1506.06158
Structured Training for Neural Network Transition-Based Parsing
원문 초록
We present structured perceptron training for neural network transition-based dependency parsing. We learn the neural network representation using a gold corpus augmented by a large number of automatically parsed sentences. Given this fixed network representation, we learn a final layer using the structured perceptron with beam-search decoding. On the Penn Treebank, our parser reaches 94.26% unlabeled and 92.41% labeled attachment accuracy, which to our knowledge is the best accuracy on Stanford Dependencies to date. We also provide in-depth ablative analysis to determine which aspects of our model provide the largest gains in accuracy.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
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
토론
이 논문과 연결된 포럼 글이 아직 없습니다.