Downloadliste

Projektbeschreibung

RelEx is an English-language semantic dependency relationship extractor, built on the Carnegie-Mellon Link Grammar parser. It can identify subject, object, indirect object, and many other syntactic dependency relationships between words in a sentence; it generates dependency trees, resembling those of dependency grammars, and specifically, those of Dekang Lin's MiniPar and the Stanford parser. It accomplishes this by applying a sequence of rules, based on the local context, and thus resembles constraint grammar in its implementation. In this sense, it implements some of the ideas of Hudson's Word Grammar. However, unlike other dependency parsers, RelEx attempts a greater degree of semantic normalization.

Systemanforderungen

Die Systemvoraussetzungen sind nicht definiert
Information regarding Project Releases and Project Resources. Note that the information here is a quote from Freecode.com page, and the downloads themselves may not be hosted on OSDN.

2009-10-14 21:19
1.2.0

Am auffälligsten in dieser Version ist der Zusatz von einem Modus, der Ausgang mit dem Stanford Abhängigkeit Parser zur Verfügung stellt. Diese Übung verstärkt Ideen, wie unterscheidet sich von Relex, und in vielerlei Hinsicht weiter fortgeschritten ist als andere Abhängigkeit Parser. Relex bietet mehr Normalisierung, insbesondere für die Fragen, die eine bessere Ausgangslage für die Argumentation und Frage-Antwort-Systemen macht. Der Kompatibilitätsmodus ist derzeit in der Beta.
Most notable in this release is the addition of a mode that provides output compatible with the Stanford dependency parser. This exercise reinforced ideas of how RelEx differs from, and in many ways is more advanced than other dependency parsers. RelEx provides more normalization, particularly for questions, which makes it a better starting point for reasoning and question-answering systems. The compatibility mode is currently in beta.

Project Resources