Connect-k is a framework for experimenting with and testing general AIs for games within the connect-k family. This includes Tic-Tac-Toe, Go-moku (without removal rules), and Connect-6. The program features an attractive GTK+ interface, a convenient API, and several challenging AIs.
Boosting is a meta-learning approach that aims at combining an ensemble of weak classifiers to form a strong classifier. Adaptive Boosting (Adaboost) implements this idea as a greedy search for a linear combination of classifiers by overweighting the examples that are misclassified by each classifier. icsiboost implements Adaboost over stumps (one-level decision trees) on discrete and continuous attributes (words and real values). This approach is one of the most efficient and simple to combine continuous and nominal values. This implementation is aimed at allowing training from millions of examples by hundreds of features in a reasonable amount of time/memory.
CellWriter is a grid-entry natural handwriting input panel. As you write characters into the cells, your writing is instantly recognized at the character level. When you press 'Enter' on the panel, the input you entered is sent to the currently focused application as if typed on the keyboard. Writer-dependent, CellWriter learns your handwriting for reliable recognition. Correcting preprocessor algorithms account for digitizer noise, differing stroke order, direction, and number of strokes. Unicode support enables you to write in any language.
METSlib is an object-oriented metaheuristics framework in C++ designed to make implementing or adapting models easy. The model is modular: all the implemented search algorithms can be applied to the same model. METSlib implements the basics of some metaheuristics algorithms, such as Random Restart Local Search, Variable Neighborhood Search, Iterated Local Search, Simulated Annealing, and Tabu Search. For each algorithm, you must implement an objective function, a neighborhood (move manager), and some moves. Tabu Search is one of the fastest ways to generate near-optimal solutions to a wide range of hard combinatorial optimization problems.
Algraeph is a tool for manual alignment of linguistic graphs, such as phrase structure trees or dependency structures, where each node corresponds to a subsequence of the analyzed input sentence. It allows you to express the similarity between two graphs by aligning their nodes and attaching relation labels to these alignments. Graphs are read from one or more graphbanks (or treebanks) in the GraphML or Alpino formats. Alignment relations are user-defined and are stored in a simple XML format, which can be used for further processing. The resulting parallel graph corpus is a useful data set for many tasks in computational linguistics and natural language processing.
pyECTOR is a chatterbot which learns from what people say. It is based on an artificial intelligence architecture that is inspired by Copycat, an AI system from Mitchell and Hofstadter. The Concept Network it uses is a mix between neural and semantic networks. It uses co-occurrences to compute the influence of one semantic node on another. The links are statistically weighted.
ERDexpert is a interface to an Erlang expert assertion engine. ERDialog is an application framework using Yaws. Multiple applets can be loaded into the framework. The existing applets include a file launcher, mpd audio interface, and wiki. This is the full release and only needs Erlang and Yaws installed.
Thinknowlogy is grammar-based software designed to utilize the logic contained within grammar in order to create intelligence through a natural language, which is demonstrated by programming in a natural language, reasoning in a natural language (drawing conclusions, making assumptions (with a self-adjusting level of uncertainty), asking questions (about gaps in the knowledge), and detecting conflicts), and intelligent answering of "is" questions, providing alternative answers as well.