search

clab / lstm-parser

Transition-based dependency parser based on stack LSTMs
Apache License 2.0
204 stars 62 forks source link

Reusable #12

Closed duncanka closed 7 years ago

duncanka commented 7 years ago

This is a major refactoring that doesn't actually change the workings of the algorithm. The primary purpose is to make the parser reusable beyond the training session: it can now load a pre-trained model and run that model on sentences without oracle transitions. This refactoring also removes the requirement that the training model be present at test time, stores all relevant parameters in the saved model, and allows compressing the saved model. Finally, the parser should now be usable by API from other applications.

duncanka commented 7 years ago

I have pre-trained English models available for this version, as well, which I can add once the pull request has been approved.