M
No analysis available
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.
0
lines of code
0
current contributors
0
since last commit
0
users on Open Hub