MSTParser is a non-projective dependency parser that searches for maximum spanning trees over directed graphs. Models of dependency structure are based on large-margin discriminative training methods. Projective parsing is also supported.
mstparser 0.5.1 is now available via Maven Central. If you use Maven as your build tool, then you can add it as a dependency in your pom.xml file:
- First and second order projective and non projective parsing
- Perceptron and k-best MIRA training
- Edge-wise confidence estimation (as of v0.5.0)
LicenseApache License V2.0
Rate This ProjectLogin To Rate This Project
There are no 2 star reviews.