Search Results for "full version"

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 full text search engine (http://cwb.sourceforge.net) and a range of statistical functions (factorial analysis, classification, cooccurrency analysis, etc.) based on R packages (http://www.r-project.org). ...

...Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known network flow and other graph algorithms. A fast parallel implementation of the network simplex method, and some full-fledged parallel/distributed MIP solvers will be added in the next version. In general, emphasis is given in improving the efficiency of the algorithms in shared-memory models via java threads, since multi-core machines are so wide-spread today.

The JINSECT toolkit is a Java-based toolkit and library that supports and demonstrates the use of n-gram graphs within Natural Language Processing applications, ranging from summarization and summary evaluation to text classification and indexing.

Free and open source grammar checker. Currently capable of identifying errors: 1) Incomplete sentence (fragment) 2) Subject Verb Plurality Agreement Incomplete Sentence Example: "John a very man." Subject Verb Plurality Agreement Example: "They walks into a classroom." This software utilizes parts-of-speech tagging software that was developed and published by the Natural Language Processing Group at Stanford University. Many thanks!!! (Full citation in README)

Basic natural language processor capable of solving elementary math word problems such as: 1) John has 7 pencils. He buys 10 more pencils. How many pencils does he have in all? 2) There are 6 boys and 4 girls in a library. How many kids are there altogether? 3) Bob ran 8 miles and Stella ran 2 miles. How many miles did they run altogether? 4) What is the sum of 7 and 2? 5) What is 8 divided by 2? 6) What is the 10 subtracted by 2? 7) What is 2 subtracted from 10? Also shows users...