Search Results for "voice command java" - Page 2

The program creates OWL ontology files that describe relationships between entities. Basis are definitions found by searching Wikipedia articles for specific lexico-syntactic patterns.

CORPSE (CORPus SEarch) is a powerful search engine written in Java. The aim is to provide an efficient implementation of a word level inverted index search with various cool functions that can be used on very large corpora.

Java program to create a (potentially multilingual) glossary of the unique words in any given Lojban text. Note that the Sourceforge page for this was superceded by the Bitbucket repository: https://bitbucket.org/pretoriusjf/vlastezba/overview Any further updates will be made there.

Linear text segmentation algorithm based on a sliding window technique.

This project is contains implementations of algorithms to integrate the output of different NLP tools (part of speech taggers, morphologies, parsers, etc.) in order to obtain more accurate, more robust and more fine-grained linguistic analyses. Note that the code is outdated, but left here for documentation purposes. Its functionality may be reimplemented within the NLP2RDF project (http://code.google.com/p/nlp2rdf).

Sanchay is a collection of tools and APIs for language researchers. It has some implementations of NLP algorithms, some flexible APIs, several user friendly annotation interfaces and Sanchay Query Language for language resources.

InGen is a java-based tool that automatically extracts keywords from a given LaTeX-Document and creates an index for those keywords.

DawNLITE is a Natural-Language-based Image Transmoding Engine. The software transforms an image to a video as recorded by a virtual camera panning and zooming over the image, following a natural language text description of the image.

ConTextKit is a Java-based implementation of Wendy Chapman's ConText algorithm for annotating the context of medical documents, specifically the negation, temporality, and experiencer.

The Stemmer class transforms a word into its root form. The input word is provided from the add() methods. The stem() method will return the stem as will toString() after stem() has been called). The clear() method will wipe the Stemmer buffer and allow a new word to be input. This version extends Martin Porter's original stemming algorithm by allowing capital letters to exist in words. This version should also be plugged in wherever the old algorithm is used with few...

Supertagging is a process of statistical lexical disambiguation, preprocessing step to parsing, which assigns LTAG tree categories to the lexical items present in the input sentence. Thus, if the input sentence is in the form of a dependency tree, the task of the supertagger is to assign the most probable TAG family to each node and edge in the dependency tree.