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.
http://www.seas.upenn.edu/~strctlrn/MSTParser/MSTParser.html
narcissa_shr created the Training from partial trees forum thread
katjabuyko created the Interface to DependecyParser Functionality forum thread
The parser was crashing when run with the both non-projective and second order options. The cause was incomplete serialization of DependencyInstances; this bug has been squashed. Download release 0.4.3b to get the fix.
jasonbaldridge committed revision 116 to the MSTParser SVN repository, changing 2 files
jasonbaldridge committed revision 115 to the MSTParser SVN repository, changing 3 files
jasonbaldridge committed revision 114 to the MSTParser SVN repository, changing 2 files
lid0kh commented on the The program crashes with specific parameter settings artifact
jasonbaldridge committed revision 113 to the MSTParser SVN repository, changing 1 files
The last version (0.4.2) had a lot of extra feature turned on which led to reduced performance for a number of data sets. (Those features were for discourse parsing, not sentential parsing.) Things are now cleanly separated, so the old results can be ...
Copyright © 2009 SourceForge, Inc. All rights reserved. Terms of Use