MSTParser is a non-projective dependency parser (see McDonald et al., 2005a, 2006) that searches for maximum spanning trees over directed graphs. Models of dependency structure are based on large-margin discriminative training methods (see McDonald et al., 2005b). Projective parsing is also supported (see McDonald et al., 2005a).
For more details about this tool, see please

You don’t have the permission to edit this resource.