Search Results for "search"

pgvector is an open-source PostgreSQL extension that equips PostgreSQL databases with vector data storage, indexing, and similarity search capabilities—ideal for embeddings-based applications like semantic search and recommendations. You can add an index to use approximate nearest neighbor search, which trades some recall for speed. Unlike typical indexes, you will see different results for queries after adding an approximate index. An HNSW index creates a multilayer graph. ...

...This architecture enables cost-efficient storage and elastic scaling for workloads that involve large datasets and complex queries. Databend provides a unified engine capable of handling analytics, vector search, and full-text search within a single platform. Databend supports SQL-based workflows and enables real-time data ingestion, transformation, and analysis through streaming and task orchestration features. With its cloud-native design and distributed architecture, Databend can run both as a self-hosted system or within managed environments to power data analytics, AI workloads, and large-scale data.

...It is built for speed, with average repositories indexed in milliseconds and structural queries answered in under one millisecond. It ships as a single static binary for macOS, Linux, and Windows with no shared library dependencies. It also includes semantic search, BM25 search, graph visualization, auto-indexing, and cross-repository intelligence.

...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). Read the scientific background at the Textométrie project web site http://textometrie.ens-lyon.fr/?...

...The goal of this project is to understand location-based strings in every language, everywhere. Addresses and the locations they represent are essential for any application dealing with maps (place search, transportation, on-demand/delivery services, check-ins, reviews). Yet even the simplest addresses are packed with local conventions, abbreviations and context, making them difficult to index/query effectively with traditional full-text search engines. This library helps convert the free-form addresses that humans use into clean normalized forms suitable for machine comparison and full-text indexing. ...

darkforestGo is an early deep-reinforcement-learning Go engine that combined a convolutional policy/value network with Monte Carlo Tree Search (MCTS) to play the full 19×19 game at a strong amateur level. The system couples fast GPU policy inference with CPU or GPU-assisted tree search so priors from the network guide exploration while search refines local tactics. Training pipelines mix supervised learning from human professional games and self-play fine-tuning, allowing the model to learn opening patterns and endgame tactics beyond simple pattern libraries. ...

[ Please read https://sourceforge.net/p/darkbot/news/2014/01/darkbots-revitalization/ ] Darkbot is a portable IRC chat robot written in the C language that can be taught responses to user inquiries, and even have conversations with them. Darkbot was originally created by Jason Hamilton as an aid for help channels on Intenet Relay Chat.

This project aims to build a suite of Natural Language Processing tools. Modules will include corpus indexing and access tools, a part-of-speech tagger, tokenisers, text classification software, etc.

Flipper is a program that does randomised local search for satisfiability of 3 variable prenex sentences in the pure predicate calculus. It does so by proving satisfiability relative to given decidable theories.

SYRAH si propone di far emergere e rappresentare i concetti espressi per mezzo di un linguaggio naturale. SYRAH aims to discover and represent concepts expressed in natural languages. NLP, lemma, lemmario, italiano, rete, semantica, clustering, semantic

It's Windows version of WordNet 3.0 (not provided on author's site) with c code source for compiling with visual studio

XOMaster is a fairly strong AI five in a row (free-style gomoku) player. It implements a simple interface and an alpha-beta search function with a fast eval function.

3store is an RDF "triple store", written in C and backed by MySQL and Berkeley DB. It is an optimisation and port of an older triple store (WebKBC). It provides access to the RDF data via RDQL or SPARQL over HTTP, on the command line or via a C API.

The Infomap NLP software performs automatic indexing of words and documents from free-text corpora, using a variant of LSA to enable information retrieval and other applications. It was developed by the Infomap Project at Stanford University's CSLI.

Sprawler is the first Open Source internet search engine software and service - built by the community, for the community. It will address the various reasons most search engines today still are far from being where they need to be.

The aim of this project is to search for the best solution to the Solitaire board game starting with a cross. The computer searches for solutions by playing by itself.

Surviving bots is continuous software application in Java that will guide robots to search for energy source around it, tap it and explore ahead for survival and thus evolve into much more advance system.Software is ment to be hardware independent.

KINg (KINg Is Not google!) is an effort to create a smart search engine, initially not to be used on the web, but to be used with documents in electronic format in our machine.

Wa (word analysis) engine is a engine implementing common IA algorithms such as in-depth tree search using alpha-beta.

This is a very simple implementation of the genetic algorithm framework presented by John Holland, based on Goldberg book Genetic Algorithms in Search, Optimization and Machine Learning.