A code-searching tool similar to ack, but faster.

Next-Generation full text search library for Browser and Node.js

Extract Keywords from sentence or Replace keywords in sentences.

🔍 Ambar: Document Search Engine

A signature-based search engine

Lightweight and read-write optimized full text search library.

Ncurses code parsing tool

High performance Trie and Ahocorasick automata (AC automata) Keyword Match & Replace Tool for python

Tools to make searching and viewing easy.

A fast implementation of single-pattern substring search using SIMD acceleration.

JavaScript Text Statistics that counts lines, words, chars, and spaces.

DEPRECATED: Use of this repository is deprecated. Please use Scout Extended - https://github.com/algolia/scout-extended instead.

Falcon REST API with Redis - Simple Text search service

Extract city and country mentions from Text like GeoText without regex, but FlashText, a Aho-Corasick implementation.

In-memory search index by strings (suffix trie)

Understanding Search Engine concepts and implementing the same using C++ and STL .

A small, flexible neural and data search engine, written in Julia. Batteries not included.

Simple full-text search for ember-cli apps using lunr.js

⏱ Small and super Fast advanced ^wildcards*$ | Unique algorithms that was implemented on native unmanaged C++ but easily accessible in .NET via Conari (with caching of 0x29 opcodes +optimizations) etc.

Extract Keywords from sentence or Replace keywords in sentences. @ https://github.com/vi3k6i5/flashtext

Examples for running Python code from Elixir

Accurate Search is the fastest and most accurate Javascript full-text search library. Accurate Search uses match distance algorithm to return the accurate order of the matching items.

This Google Chrome extension allows you to add our custom words to a list and have them, automatically, highlighted as you browse the Web

Are you looking for a word in many pdf files? Do it one time. ⚡

This is a command-line program for searching text for multiple words (or phrases) in a single pass. The runtime is O(n + m + z), where n is the length of the searched text, m is the total length of all the words we are looking for, and z is the total number of occurrences of words we are looking for.

Grep through all Grafana entities in the spirit of git-wtf.

Full text search using PowerShell, Everything, and Lucene.

Thin covers for Dyalog APL's ⎕R and ⎕S

A webpack plugin to minify html file(s) after building