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.

Sign up for GitHub

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

Jump to bottom

MST parsing algorithms #2

Open
tdozat opened this issue Jun 18, 2017 · 0 comments
Open

MST parsing algorithms #2

tdozat opened this issue Jun 18, 2017 · 0 comments
Assignees
@tdozat
Labels
enhancement

Comments

@tdozat
Copy link
Owner

tdozat commented Jun 18, 2017

The current way of ensuring valid trees is pretty hacky. Ideally, there should be three ways of MST parsing the returned probabilities, which should be configurable:

  1. Argmax (greedy)
  2. Eisner (projective)
  3. Chu-Liu/Edmonds (nonprojective)
@tdozat tdozat self-assigned this Jun 18, 2017
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@tdozat tdozat

Labels
enhancement
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@tdozat