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.
- First and second order projective and non projective parsing
- Perceptron and k-best MIRA training
- Edge-wise confidence estimation (as of v0.5.0)
Works well for me. Will use it again in the future.
A great application that is true to its promise. Thank you very much.
You can give me how to run MST Parser to generate k-best trees for one sentence (not the best tree as default). Many thanks!