Search Results for "dependency" - Page 2

...Multiple alignments, phylogenetic trees and evolutionary parameters are co-estimated in a Markov Chain Monte Carlo framework, allowing for reliable measurement of the accuracy of the results. This approach eliminates common artifacts that traditional methods suffer from, at the cost of increased computational time. These artifacts include the dependency of the constructed phylogeny on a single (probably suboptimal) alignment and bias towards the guide tree upon which the alignment relies. The models behind the analysis permit the comparison of evolutionarily distant sequences: the TKF92 insertion-deletion model can be coupled to an arbitrary substitution model. A broad range of models for nucleotide and amino acid data is included in the package and the plug-in management system ensures that new models can be easily added.

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

...Data processing pipelines require high-level organization and parallelization of work to optimize resource utilization and decrease the time to results. q (from queue) allows complex job sequences to be efficiently assembled and managed, including dependency tracking, parallelization, and pipeline-level monitoring, error recovery, and data protection. Pipelines are constructed from modular script files, with job definitions and results stored in easily retrieved job files. A web interface facilitates job submission and monitoring, with the complete pipeline exportable for full transparency.

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>

Highly efficient Data Generator for Benchmarks and Algorithm Performance Analysis. Supports fully configurable schemata as well as meta structures like Foreign Keys and Functional Dependencies.

...Using a couple lines of code, you'll be able to parse complex arithmetic expressions efficiently. This library is powered by Dijkstra's Shuting-yard algorithm. The library has no dependencies with other external libraries. Dependency <dependency> <groupId>com.google.code.mathparser-java</groupId> <artifactId>mathparser-java</artifactId> <version>1.0.0</version> </dependency> Expressions supported (Mar/09/2013) - Arithmetic operations. Working on (Mar/09/2013) - Geometrical functions support

SCons is a make replacement providing a range of enhanced features such as automated dependency generation and built in compilation cache support. SCons rule sets are Python scripts so as well as the features it provides itself SCons allows you to use the full power of Python to control compilation. This is a SCons extension (tool) which enables usage of the dvipdfm program to convert dvi files to pdf.

Darwin 2: Java Framework for Evolutionary Computation (genetic algorithm, GA). A true framework with out-of-the-box functionality and extensibility of all classes. Interface-based pattern with dependency-injection to configure components.

TikZ-dependency allows you to draw dependency graphs in LaTeX documents with little or no effort. The package has a very easy to learn, high level interface that can be used to draw simple dependency trees, complex non projective graphs, bubble parses, and in general any kind of graph which is based on a sequence of nodes and edges among these.

CNC Machine Tool / Automation Framework + HMI

compeo++ is a light-weight command line tool for GNU/ Linux to interact with flight instruments made by Bräuniger/ Flytec (5020, 5030, 6020, 6030, Competino, Compeo, Competino+, Compeo+). It comes as a portable C++ application with no dependency on any other program (except the GNU/ Linux platform libraries). It aims at being easy to install, easy to run and easy to use. It was written and tested on a two+ years old netbook. It concentrates on supporting the essential instrument management use cases: - Browse and export track logs. - Browse, export and import waypoints...

Bras is a rules-based command execution system, ala 'make'. It includes a powerful rules system supporting foreign directory triggers, multiple rule types, and on-the-fly dependency generation. It is written in Tcl and uses Tcl as its script language.

Composer for OWL-S-based Semantic Web Services that can load SWRL-based Semantic Bridges to mediate between heterogeneous ontology concepts. Exports semantic. enh. BPEL code. Dependency to BerliOS-project: "sembpelext". Also see QualiPSo.org for details.

A Tiny Excel VBA Program to Perform Dependency Test for Two-way Contingency Tables by AIC

Anna is lightweight Java framework to build pipeline systems of any kind. It will take care of recurrent needs such as dependency management, data serialisation and synchronization as well as parallelization of execution.

fedg extracts knowledge and relevant events in chinese texts to generate Feature Event Dependency Graph.FEDG is a knowledge representation model,meaningful for latent knowledge discovery and efficient reasoning.

Implements the response of a gaussian function in dependency of abscissa, mean value and standard deviation. Further implementations will provide a Lookup-Table based solution to calculate exponential values without dependency to precompiled libraries.

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.

GraphSpider is a pattern matcher which searches parsed text in phrase-structure tree or dependency graph format for syntactic structures matching a set of patterns in MPL, a regexp-like pattern language. Applications: information extraction, text mining.