Search Results for "data structures"

TXM is a free and open-source cross-platform Unicode & XML based text analysis environment and graphical client, supporting Windows, Linux and Mac OS X. It can also be used online as a J2EE standard compliant web portal (GWT based) with access control built in. DOWNLOAD LATEST VERSION OF TXM : http://textometrie.ens-lyon.fr/spip.php?rubrique61&lang=en TXM offers a comprehensive range of analysis tools (concordances, collocate search, frequency lists, etc.) based on the powerfull CQP...

The project develops new new techniques and algorithms for quickly partitioning and visualizing very large hierarchical structures within a variety of arbitrary shapes and space using Divide and Conquer approach for Treemaps. Related publications: https://www.sciencedirect.com/science/article/pii/S1045926X1500066X https://dl.acm.org/doi/pdf/10.1145/2493102.2493112

Full documentation with tutorials is included in the download package. Graphical Grammar Studio is a tool for applying grammars which behave as words acceptors/consumers and annotators. GGS grammars can be used to find and annotate sequences of words which respect certain conditions, in a given input. Its purpose is for creating NLP tools like phrase chunkers, named entity finders, pronoun co-reference solvers etc. A grammar is represented by a state machine which can be visualized, edited...

The goal of project is delivering useful and simple tools to creating charts. Functionality is provided by modules/plugins (OSGi technology). It allows you to create your plugins or customize Analysis application (by changing installed plugins in application). The Application, thanks to JAVA technology, is portable on the most operating system. In Files page you can find the application and also patches to its.

An implementation of "k-Way Merging" as described in "Fundamentals of Data Structures" by Horowitz/Sahni. NOTE: This project has been moved to http://code.google.com/p/kway/

UDA stands for Universal Descriptive Algebra. It consists of a Java package handling universal algebras and relational structures as description systems.

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.

JavaMatch is an engine that can search inside a runtime Java data structures, and look for objects that best match the criteria that you specify. The extensive query mechanism allows for highly customizable tuning of your match queries.