Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Feature : Dependency Parsing #132

Open
Ayushk4 opened this issue Mar 12, 2019 · 2 comments
Open

Feature : Dependency Parsing #132

Ayushk4 opened this issue Mar 12, 2019 · 2 comments

Comments

@Ayushk4
Copy link
Member

Ayushk4 commented Mar 12, 2019

It would be nice to have support for Dependency Parsing in Julia. We can have it as a part of TextModels.jl as per #111.

If we go with Graph Based parser then we get accuracy for more time, however a Greedy one will be faster for little less accuracy.
Some possible implementations could be - Deep Biaffine, https://arxiv.org/pdf/1505.08075v1.pdf

@dellison
Copy link

dellison commented Mar 12, 2019

For what it's worth, I've recently registered DependencyTrees.jl. So far I've only implemented greedy transition-based parsing algorithms, but I'm hoping to add support for graph-based methods soon. Maybe that could be helpful.

@dellison
Copy link

Also- please feel free to open an issue over on DependencyTrees.jl if you have a feature request or a usage question or anything else like that! Anything that could help me improve it would be very welcome :)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants