Search Results for "alpha zero"

Not working yet. To deal with the Halting Problem, computing and data are navigated using debugger ops: linearForward and treeForward, which navigate an astronomically large bit string where 1 is ( and 0 is ). All pairs are derived from (). For example, true is represented as ((()())()), and false is (()(()())). It appears related to the church encoding of lambda where T chooses first parameter and F chooses second, of a pair. Continuations are nearly finished code and are represented as a pair...

... of that as Bits, subranges of them, and ints for sizes of its parts. Expansion ability for other kinds of compression, since Bits is a Java interface. Main functions on bits are substring, concat, number of 0 or 1 bits, and number of bits (size). All those operations can be done millions of times per second regardless of size because the AVL forest reuses existing branches recursively. Theres a scalar (originally for copy/pasting subranges of sounds) and a bit Java package. Sparse n dimensional matrix.

WARNING: There are too many false-positives! This is Alpha release, expect many things to improve, including the algorithms. PLEASE GO TO BROWSE ALL FILES TO READ A FULL DESCRIPTION. The goal of this project is simple: Input two sentences of the same language, and obtain the number (from 0 to 1) denoting the similarity between the inputted sentences, according to semantic categories. This project models my previous project: https://sourceforge.net/projects/semantics/ Difference...

This application was developed by Incentro to satisfy requests by clients for a sentiment analyser for the Dutch language. It is currently in it's alpha stage and we expect to have a beta release by November 2012. If you would like to help with the development or testing of this product please contact us at +31[0]15 76 40 750 - of info {at} incentro.com. Deze applicatie is ontwikkeld door Incentro om te voldoen aan klantaanvragen voor een sentimentanalyse module voor de Nederlandse taal...

A "limited lookup parser": stupid but assiduous tool for grammar developers. It generates all words for a given grammar up to a certain level of derivation steps and stores the results in a database. Thus the actual parsing process is a simple lookup task