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.
Code (0)
등록된 구현이 없습니다.
Tasks
Dependency ParsingTransition-Based Dependency ParsingSimilar Papers 제목 키워드 기반
Efficient Structured Inference for Transition-Based Parsing with Neural Networks and Error States
Transition-based approaches based on local classification are attractive for dependency parsing due to their simplicity and speed, despite producing results slightly below the state-of-the-art. In this paper, we propose …
Dependency ParsingFeature EngineeringGeneral ClassificationStructured Prediction+2Graph-to-Graph Transformer for Transition-based Dependency Parsing
We propose the Graph2Graph Transformer architecture for conditioning on and predicting arbitrary graphs, and apply it to the challenging task of transition-based dependency parsing. After proposing two novel Transformer …
Dependency ParsingStructured PredictionTransition-Based Dependency ParsingA Neural Probabilistic Structured-Prediction Model for Transition-Based Dependency Parsing
Structured Sentiment Analysis as Transition-based Dependency Parsing
Structured sentiment analysis (SSA) aims to automatically extract people's opinions from a text in natural language and adequately represent that information in a graph structure. One of the most accurate methods for per…
Dependency ParsingSentenceSentiment AnalysisTransition-Based Dependency ParsingStructure-aware Fine-tuning of Sequence-to-sequence Transformers for Transition-based AMR Parsing
Predicting linearized Abstract Meaning Representation (AMR) graphs using pre-trained sequence-to-sequence Transformer models has recently led to large improvements on AMR parsing benchmarks. These parsers are simple and …
Abstract Meaning RepresentationAMR ParsingDecoderSentence