Abstract

Recent work on neural network models shows success in dependency parsing. In this paper, we present a sequence learning dependency parsing (SLDP) model using long short-term memory for shift-reduce parser. A feed-forward neural network is used to build greedy model from rich local features. With the features extracted by the local model, we further train a long short-term memory (LSTM) model optimized for global parsing sequences. Our model has the capability of learning not only atomic feature combinations automatically but also the long distance dependent information for dependency parsing. Experiments on English Penn Treebank show that our SLDP model significantly outperforms the baseline, achieving 90.7% unlabeled attachment score and 89.0% labeled attachment score.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.