Projects tagged ‘ai’ and ‘java’

Jena is Java toolkit for developing semantic Web applications. It includes an RDF API, ARP, an RDF parser used for the W3C semantics Web sandbox, RDQL (an RDF query language and processor), and a DAML API.

Project OverviewThe S-Space Package is a collection of algorithms for building Semantic Spaces. These algorithms process text corpora and map semantic representations for words onto high dimensional ... [More] vectors. These approaches are known by many names, such as word spaces, semantic spaces, or distributed semantics. The research and development is being done by the Natural Language Processing group at UCLA led by David Jurgens and Keith Stevens, under the advisory of Dr. Michael Dyer. See the Getting Started page for a quick introduction on how to use the S-Space package, or see the Package Overview for information on the code and available features. GoalOur initial goal is to provide a uniform implementation for many common semantic space algorithms in order to facilitate research in semantic spaces and provide an accurate, reproducible way to compare different algorithms. Second, we aim to provide a comprehensive framework for researchers to easily develop new algorithms without having to replicate much of the shared software. For those looking to implement their own Semantic Space algorithm within the S-Space package, we recommend looking at the Introduction page. ContactQuestions and Comments can be sent to s-space-research-dev@googlegroups.com AlgorithmsWe are actively working on supporting the following algorithms. As additional time and resources allow, we will add further algorithms. See the downloads page for the current list of algorithms available in command-line executable form. Latent Semantic Analysis (LSA)T. K. Landauer and S. T. Dumais, "A solution to Plato’s problem: The Latent Semantic Analysis theory of the acquisition, induction, and representation of knowledge," Psychological Review, vol. 104, pp. 211–240, 1997. T. K. Landauer, P. W. Foltz, and D. Laham, "Introduction to Latent Semantic Analysis," Discourse Processes, no. 25, pp. 259–284, 1998. Random Indexing (also, with permutations)P. Kanerva, J. Kristoferson, and A. Holst, “Random indexing of text samples for latent semantic analysis,” in Proceedings of the 22nd Annual Conference of the Cognitive Science Society, L. R. Gleitman and A. K. Josh, Eds., 2000, p. 1036. M. Sahlgren, “Vector-based semantic analysis: Representing word meanings based on random labels,” in Proceedings of the ESSLLI 2001 Workshop on Semantic Knowledge Acquisition and Categorisation, Helsinki, Finland, 2001. M. Sahlgren, A. Holst, and P. Kanerva, “Permutations as a means to encode order in word space,” in Proceedings of the 30th Annual Meeting of the Cognitive Science Society (CogSci’08), 2008. Correlated Occurrence Analogue to Lexical Semantic (COALS)D. L. T. Rohde, L. M. Gonnerman, and D. C. Plaut, “An improved model of semantic similarity based on lexical co-occurrence,” Cognitive Science, 2009, submitted. Online. Available: http://www.cnbc.cmu.edu/plaut/papers/abstracts/RohdeGonnermanPlautSUB-CogSci.COALS.html Hyperspace Analogue to Language (HAL)C. Burgess and P. Conley, “Developing semantic representations for proper names,” in Cognitive Science Proceedings, LEA, 1998, pp. 185–190. C. Burgess and K. Lund, “Modelling parsing constraints with high- dimensional context space,” Language and Cognitive Processes, vol. 12, pp. 177–210, 1997. Latent Relational Analysis (LRA)P. D. Turney, “Similarity of semantic relations,” Computational Linguistics, vol. 32, no. 3, pp. 379–416, 2006. Bound Encoding of the Aggregate Language Environment (BEAGLE)M. N. Jones, W. Kintsch, and D. J. K. Mewhort, “High-dimensional semantic space accounts of priming,” Journal of Memory and Language, vol. 55, pp. 534–552, 2006. M. N. Jones and D. J. K. Mewhort, “Representing word meaning and order information in a composite holographic lexicon,” Psychology Review, vol. 114, pp. 1–37, 2007. Syntactic Co-occurrence (by Greffenstette)G. Grefenstette, Explorations in Automatic Thesaurus Discovery. Indiana University Press, 1994. License and RestrictionsThe S-Space software package is free software released under the GPL v. 2 license. See our license and restrictions page for full details. [Less]

Encog is an advanced neural network and bot programming library. Encog can be used independently either to create neural networks or HTTP bot programs. Encog also includes classes that combine these ... [More] two advanced features. Encog contains classes for Feedforward Neural Networks, Hopfield Neural Networks, and self organizing maps. Training can be accomplished using backpropagation, simulated annealing, and genetic optimization. Additional classes are provided for pruning neural networks. Encog also includes advanced HTTP bot programming features. A multithreaded spider that can store its workload either in memory on a database is provided. HTML parsing is provided, as well as advanced form and cookie handling. [Less]

RelEx is an English-language semantic relationship extractor, built on the Carnegie-Mellon link parser. It can identify subject, object, indirect object and many other relationships between words in a ... [More] sentence. It can also provide part-of-speech tagging, noun-number tagging, verb tense tagging, gender tagging, and so on. Relex includes a basic implementation of the Hobbs anaphora (pronoun) resolution algorithm. Optionally, it can use GATE for entity detection. RelEx also provides semantic relationship framing, similar to that of FrameNet. [Less]

The goal of the CSPoker project is to develop Poker software and experiment with Artificial Intelligence for Poker. A Texas Hold'Em server written in Java and client software in JavaFX have already ... [More] been developed. In the long run it should be possible to train A.I. bots by playing against human players. [Less]

OpenCyc is the open source version of the Cyc technology, the world's largest and most complete general knowledge base and commonsense reasoning engine. OpenCyc can be used as the basis for a wide variety of intelligent applications.

MARF is an open-source research platform and a collection of voice/sound/speech/text and natural language processing (NLP) algorithms written in Java and arranged into a modular and extensible ... [More] framework facilitating addition of new algorithms. MARF can run distributedly over the network and may act as a library in applications or be used as a source for learning and extension. [Less]

KC Bomberman is clone of the classic Bomberman game written in Java.

What?This is an open source software for AI, Machine Learning algorithms benchmarking, written in Java with TCP interface and example agents in Java and Python. This software suits for research ... [More] , teaching and self-learning. Starting from very simple examples you have ability to dive into very complex tasks. JNI is going to be supported fairly soon. Why?Got boring one day from walking just the mazes and came up with idea to create a universal benchmark with simple interface and entertaining content. When?This project was started in March 2009. Mario AI Competition was hold @ ICE-GIC in London on August, 24th and CIG in Milano on September, 7th, 2009. Currently approaching and working on organizing AI Mario Championship 2010. Who?by Julian Togelius and Sergey Karakovskiy with participant of Tom Schaul and Jan Koutnik. Where?@ IDSIA [Less]

The dANN project is a library to help facilitate artificial neural networks within other applications. It is currently written in Java, C++, and C#. However only the java version is currently in ... [More] active development. If you want to obtain a version other than the java version you will need to get it directly from SVN. Our intentions are two fold. First, to provide a powerful interface for programs to include conventional artificial neural network technology into their code. Second, To act as a testing ground for research and development of new AI concepts. We provide new AI technology we have developed, and the latest algorithms already on the market. In the spirit of modular programming the library also provides access to the primitive components giving you greater control. [Less]