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.
Use Patent Claims
These details are provided for information only. No information here is legal advice and should not be used as such.
There are no reported vulnerabilities