PyNLPl, pronounced as 'pineapple', is a Python library for Natural Language Processing. It contains various modules useful for common, and less common, NLP tasks. PyNLPl can be used for basic tasks such as the extraction of n-grams and frequency lists, and to build simple language model. There are also more complex data types and algorithms. Moreover, there are parsers for file formats common in NLP (e.g. FoLiA/Giza/Moses/ARPA/Timbl/CQL). There are also clients to interface with various NLP specific servers. PyNLPl most notably features a very extensive library for working with FoLiA XML (Format for Linguistic Annotation).

Source Code for the Book Classic Computer Science Problems in Swift

Execute genetic algorithm (GA) simulations in a customizable and extensible way.

This repository is all about data structures, its implementation, problem and solving

This is an educational repository containing implementation of some search algorithms in Artificial Intelligence.

Infinit Pacman with JavaScript. Using multiple path-finding algorithms: A*, Greedy Best First Search, and Hill Climbing Search

A fine-tuned visual implementation of Informed and Uninformed Search Algorithms such as Breadth First Search, Depth First Search, Uniform Cost Search, A* Search, Greedy First Search

Implementations of Graph and Tree search algorithms to find the path to the goal.

Search Engine position - preliminary test

Algorithms with Programming Concepts in Java!

A tutorial to solve problems by searching.

Search and sorting algorithms

Project focused on comparing search algorithms

This repo contains all the search algorithms of graph.

Search algorithms for Python

A Web-based implementation of risk game with intelligent agents and human interaction.

Ranking algorithms for WWW - MS Computer Science thesis (2003) [Italian]

Hyperskill Implementation of Nightmare Project.

Collection of algorithms

A simple genetic algorithm written in Go.

Implementation of some important ideas in the AI world.

Finding path in a map which consist of cities using A*, Best First Search, Breadth First Search and Depth First Search.

Some sorting/searching/encryption algorithms, written in a TDD fashion

Gomoku, but with a board of any size, any number of pieces lined in a row to win, and any number of players.