prefix-search
Here are 24 public repositories matching this topic...
Sort:Most stars
Connectionist Temporal Classification (CTC) decoding algorithms: best path, beam search, lexicon search, prefix search, and token passing. Implemented in Python.
- Updated
Jul 26, 2021 - Python
PruningRadixTrie - 1000x faster Radix trie for prefix search & auto-complete
- Updated
Jun 27, 2024 - C#
An efficient implementation of RNN-T Prefix Beam Search in C++/CUDA.
- Updated
Dec 8, 2020 - Cuda
Sorted Data Structure Server - Treds is a Data Structure Server which returns data in sorted order and is the fastest prefix search server. It also persists data on disk.
- Updated
Feb 10, 2025 - Go
a fast and light-weighted key-value store library
- Updated
Feb 23, 2025 - C++
PyPruningRadixTrie - Python version of super fast Radix trie for prefix search & auto-complete
- Updated
Dec 4, 2024 - Python
This example project demonstrates a clean way to architect an Android application.
- Updated
Oct 5, 2021 - Kotlin
🏃 🏃 🏃Somewhat fast, somewhat optimal Prefix Search in Go
- Updated
Apr 25, 2017 - Go
An implementation of RadixTree data-structure, which is a great tool for indexing a large number of records with string keys.
- Updated
Dec 29, 2021 - Kotlin
LexiSearch is an API for retrieving information in given datasets.
- Updated
Dec 16, 2020 - Java
Radix is an adaptive radix tree for in-memory database indexes.
- Updated
Oct 23, 2020 - Go
Build an efficient and customized dictionary using modified TRIE data structure having substring search, sorting and autocomplete features from a file of words in C++.
- Updated
Oct 28, 2020 - C++
Simple Prefix Binary Tree-based string search engine written in Rust.
- Updated
Oct 9, 2023 - Rust
Python bindings for NodeTrie, a prefix tree data structure library
- Updated
Nov 1, 2017 - Python
a fast and light-weighted key-value store library
- Updated
Jun 14, 2018 - C++
PHP/MySQL Script that returns Nigerian mobile network name based on the prefix of the mobile phone number.
- Updated
Dec 31, 2020 - PHP
Algorithm to find the longest matching prefix for a binary string using a binary trie
- Updated
Dec 10, 2023 - Rust
Implementation of Data Structures and Algorithms
- Updated
Feb 7, 2023 - Java
This project implements a 26-way Trie data structure to manipulate and manage strings efficiently.Then inserts all words to the trie from the given txt file.
- Updated
Jun 28, 2024 - Java
Improve this page
Add a description, image, and links to theprefix-search topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with theprefix-search topic, visit your repo's landing page and select "manage topics."