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
Release Date:
Topics:
License:
Operating System:
Intended Audience:
User Interface:
Programming Language:
Registered:
Ratings and Reviews
- Thumbs up: 1
- Thumbs down: 0
Be the first to post a text review of MSTParser. Rate and review a project by clicking thumbs up or thumbs down in the right column.
Project Feed
-
Forum thread added
narcissa_shr created the Training from partial trees forum thread -
Forum thread added
katjabuyko created the Interface to DependecyParser Functionality forum thread -
minor bug fix
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.
-
mstparser v0.4.3b (Bug fix) file released: mstparser-0.4.3b-src.tgz
-
File released: /mstparser/v0.4.3b (Bug fix)/mstparser-0.4.3b-src.tgz
-
Code committed
-
Code committed
-
Code committed
-
Tracker comment added
lid0kh commented on the The program crashes with specific parameter settings artifact -
Code committed
About SourceForge
Develop Software
Copyright © 2009 Geeknet, Inc. All rights reserved. Terms of Use
