Search Results for "cli-parser" - Page 15

...The algorithm was implemented in Java and can be described as a form of a parsing expression grammar, where we generate the expressions to be detected beforehand by regular expressions and store them in a vocabulary. The central class is the parser class, which is instantiated as a series of vocabularies, simple text lists that describe tokens and synonyms, and value descriptors. It's meant as a lightweight alternative to "real" NLP (natural language processing).

S-Match is a semantic matching framework. S-Match takes any two tree like structures (such as database schemas, classifications, lightweight ontologies) and returns a set of correspondences between those tree nodes which semantically correspond to one another. S-Match contains implementations of the semantic matching, minimal semantic matching and structure preserving semantic matching algorithms. S-Match applies as a solution in many fields, including: information integration,...

DeSR is a multilingual statistical dependency parser. It produces dependency parse trees for natural language sentences using a parsing model learned from annotated corpora.

The MaxParser is written in c++ and can parse with first, second, third and fourth order projective Graph-based Dependency parsing algorithm. The project is the new version of the project "Max-MSTParser". If you want to use this software for research, please reference this web address in your papers

TexLexAn is an open source text analyser for Linux, able to estimate the readability and reading time, to classify and summarize texts. It has some learning abilities and accepts html, doc, pdf, ppt, odt and txt documents. Written in C and Python.

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> <version>0.5.1</version> </dependency>

Console and GUI parser and calculator of mathematical expressions

JLinkGrammarParser is a Java port of the CMU link grammar parser, a syntactic parser for english.

Alkhalil Morpho Sys is a morphosyntactic parser of Arabic words. The system can process non vocalized texts as well as partially or totally vocalized ones. Our approach is based on modelling a very large set of Arabic morphological rules, and also on integrating linguistic resources, such as the root database, vocalized patterns associated with roots, and proclitic and enclitic tables.

iGROM helps you with developing programs in languages such as DLV or smodels. Can be used either as stand-alone or as a plugin to Eclipse. You can also extend it to other similar languages by only writing a parser and several support classes.

SALIX is a web application for the OCR and natural language parsing of Herbarium specimen labels

crfparser is a simple open source projective Maximum Spanning Tree dependency parser for practical natural language processing applications.

This project develops a web-based (JSP) Fuzzy Rule-Based Expert System for analyzing ECG (electro cardio gram) signals & diagnosing Tachi-Arrhythmias. Proj. main blocks: inference engine, knowledgebase, KB editor, explanation, and feature extraction.

OpenDMAP (Open Source Direct Memory Access Parser) is a natural language processing (text mining) application: a semantic parser for information extraction.

Robotic Simulator: try different AI techniques to improve your robots. Special for competitions, research, or educational use.

CaboCha is a Japanese dependency/syntactic parser based on machine learning.

lightJacc is a small but strong grammar parser generator. It adopts a parsing strategy of its own: dynamic concurrent parsing -- which made it much stronger than LR or LL family CCs (YACC, ANTLR, etc), but still keep good performance.

A modular language generator based on the theory of Functional Grammar (FG) by Simon C. Dik. Implemented using Java for the user interface, ANTLR for the input format parser and Prolog for the grammar and lexicon module, treating underlying linguistic st

PDDL4J is an open source library to facilitate java implementation of planners based on the PDDL (Planning Description Language). The library contains a parser on the last version of PDDL 3.0 and an example of graphplan implementation.

...Ruledit is protected by copyright of Zlatan Mur Graphical rule editor for JBoss Drools rules. Can be easily extended to parse rules for any other rule engine. Also includes parser for HQL/SQL for rule testing on a database. Aditional plugins for rule deploy can also be obtained

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).

Provides a GUI interface to grammatical structure and relations (as parsed by the Stanford Parser) of any text. Contains grammatical relation editor to modify, import, export grammatical relation definitions (tregex patterns and features).

Lillybot is an OpenCyc-based irc chatbot. It implements a very simple reasoning engine that works with the OpenCyc ontology, and hooks it to a natural-language parser. It can answer simple english questions with small simple-english replies.

SwiRL is a Semantic Role Labeling (SRL) system for English constructed on top of full syntactic analysis of text.

The aim of MIEX (Metadata and Information Extractor from small XML documents) is to create a wrapper for the Stanford Parser, to extract and store metadata (syntactic structures, relationships among words...) from simple XML documents.