Persistent, simple, powerful and portable autocomplete library
-
Updated
Sep 7, 2024 - C#
Persistent, simple, powerful and portable autocomplete library
Artado Search is open source, private and highly customizable search engine
autocomplete, fuzzy matching, and short-string lookups
Implementation of Aho-Corasick string matching algorithm for .NET
A free & open-source Donor Search Algorithm Service
This is a practice project for implementing a simple search engine.
Semantic search web app using the Large Language Model (LLM) Cohere for embeddings to match context and meaning, rather than keywords.
Search algorithms and their benchmarks
Implementation of suffix array
C# Console app that solves the 8 puzzle game
"Moogle!" es una aplicación web cuyo objetivo es realizar búsquedas en una base de datos de archivos .txt y devolver los resultados en el menor tiempo posible. Para esto, se utilizan algoritmos de TF-IDF y otros conocimientos de álgebra lineal que hacen más eficiente el buscador
🔎 A .NET library that provides efficient fuzzy search, spell checking, and data indexing capabilities
Inverted index is to allow fast full text searches, at a cost of increased processing
This C# project provides implementations of two search algorithms, Binary Search and Linear Search, along with benchmarking to compare their performance.
Multilingual text search and spellchecker using Lucene.NET for .NET CMS Umbraco
Wikipedia Extractor is a lightweight C# library which can be used to extract XML page data from a Wikipedia data dump.
Implementation of Max problems: Grid, SIB, MASIB
Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures.
Add a description, image, and links to the search-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the search-algorithm topic, visit your repo's landing page and select "manage topics."