About MSTParser
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...
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:
net.sourceforge.mstparser
mstparser
0.5.1
Features
- First and second order projective and non projective parsing
- Perceptron and k-best MIRA training
- Edge-wise confidence estimation (as of v0.5.0)
Previous Versions
Here you can find the changelog of MSTParser since it was posted on our website on 2015-04-26 03:00:00.
The latest version is 5.1 and it was updated on 2024-04-22 15:43:39. See below the changes in each version.
MSTParser version 5.1
Updated At: 2013-09-13
MSTParser version v0.4.3c%20%28Change%20license%20to%20Apa
Updated At: 2011-05-06
Changes: Several fixes and updates
Disclaimer
External Download
We do not host MSTParser on our servers. We did not scan it for viruses, adware, spyware or other type of malware. This app is hosted by the software publisher and passed their terms and conditions to be listed there. We recommend caution when installing it.
The external download link for MSTParser is provided to you by apps112.com without any warranties, representations or guarantees of any kind, so access it at your own risk.
If you have questions regarding this particular app contact the publisher directly. For questions about the functionalities of apps112.com contact us.
