Skip to content

Graph-based and Transition-based dependency parsers based on BiLSTMs

License

Notifications You must be signed in to change notification settings

yuanyunzhe/bist-parser

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

75 Commits
 
 
 
 
 
 
 
 

Repository files navigation

BIST Parsers

A hybird of a Graph-based and a Transition-based parser using BiLSTM

This project is a hybird of a graph-based and a transition-based parser. The main principle comes from the paper Simple and Accurate Dependency Parsing Using Bidirectional LSTM Feature Representations.

Our repository is forked from elikip's repo. He wrote the code with DyNet. We use Python 3.6 with PyTorch, and my cooperator xiezhq-hermann rewrites the graph-based parser using Python3.

Required software

License

This software is released under the terms of the Apache License, Version 2.0.

About

Graph-based and Transition-based dependency parsers based on BiLSTMs

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Python 63.4%
  • Perl 36.6%