MSTParser is a non-projective dependency parser that searches for maxi
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.
mstparser 0.5.1 is now available via Maven Central. If you use Maven as your build tool, then you can add it as a dependency in your pom.xml file:
<dependency>
<groupId>net.sourceforge.mstparser</groupId>
<artifactId>mstparser</artifactId>
...
OmniHelp is a cross-platform, browser-independent, tri-pane help viewer built in pure JavaScript and CSS with HTML 4. Some functions (such as help embedding) may in the future be in Java, C, or C++; CSH is fully supported. All code is under the LGPL.
This project aims to develop a parser for Finnish. The parser and the system of grammatical competence assumed herein, are based on the minimalist theory of grammar (Chomsky 1995, 2005) and Bare Lexicon Hypothesis (Brattico, in prep).
HyperSpider (Java app) collects the link structure of a website. Data import/export from/to database and CSV-files. Export to Graphviz DOT, Resource Description Framework (RDF/DC), XML Topic Maps (XTM), Prolog, HTML. Visualization as hierarchy and map.