-
Updated
Aug 6, 2022 - Java
trie-structure
Here are 90 public repositories matching this topic...
Data Structures and Algorithms
-
Updated
Dec 28, 2023 - C++
Create and modify trie prefix structures and extract word lists including prefixes, anagrams and sub-anagrams
-
Updated
Jan 20, 2019 - TypeScript
Checking if a word is a real word (Available in English & French)
-
Updated
Oct 23, 2020 - Python
A versatile and user-friendly text editor built in Java using Swing. This editor offers a range of features, from basic file operations to advanced text formatting and real-time spell-checking.
-
Updated
Dec 5, 2023 - Java
An implementation of the wordBreak problem to split into all possible combinations of words that the original sentence could have been made up of. Takes the input from a file and outputs it to shell.
-
Updated
Dec 22, 2018 - C++
Lightweight javascript library for tree data structures.
-
Updated
Feb 18, 2022 - JavaScript
A Wikipedia sourced search engine
-
Updated
Apr 29, 2020 - HTML
Word processing engine built with trie data structure
-
Updated
Feb 9, 2024 - Go
Implementation of Trie along with replication of google like autosuggest
-
Updated
Aug 27, 2020 - Java
A simple word auto complete feature implemented using Trie Data Structure in C++.
-
Updated
Oct 5, 2020 - C++
Data Structures Java
-
Updated
Apr 22, 2019 - Java
The purpose of this project is to create a simple version of a distributed, fault-tolerant, Key-Value (KV) database (or store).
-
Updated
May 27, 2021 - Python
T9 Keyboard controled by numpad keyboard buttons
-
Updated
May 15, 2023 - Python
Pretty simple implementation of prefix tree for matching byte arrays
-
Updated
May 25, 2022 - Go
Prefix Trie data structure with Pattern Matching, in C++
-
Updated
Aug 23, 2017 - C++
A model to optimise text search and autocomplete generation using trie tree in Python.
-
Updated
Oct 17, 2022 - Python
>This project implements auto-complete function, like in Phone book. > The search is implemented with Trie data structure for efficiency. >It is built using Javascript, HTML and CSS.
-
Updated
Aug 6, 2022 - JavaScript
Named entity tagging system that requires minimal linguistic knowledge and can be applied to several target languages without substantial changes. The system is based on the ideas of the Brill’s tagger which makes it really simple. Using supervised machine learning, we construct a series of automatons (or transducers) in order to tag a given tex…
-
Updated
Jun 23, 2020 - Java
Improve this page
Add a description, image, and links to the trie-structure topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the trie-structure topic, visit your repo's landing page and select "manage topics."