gse
Go efficient fast multilingual NLP and text segmentation; support English, Chinese, Japanese and others.
- 2.8k
- Go
- Apache-2.0
- 2 d ago
Go efficient fast multilingual NLP and text segmentation; support English, Chinese, Japanese and others.
Static memory-efficient Trie-like structures for Python based on marisa-trie C++ library.
PruningRadixTrie - 1000x faster Radix trie for prefix search & auto-complete
Muxie is a modern, fast and light HTTP multiplexer for Go. Fully compatible with the http.Handler interface. Written for everyone.
Implementation of various Data Structures and algorithms - Linked List, Stacks, Queues, Binary Search Tree, AVL tree,Red Black Trees, Trie, Graph Algorithms, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Segment Trees etc.
Data structures implemented from scratch in Kotlin. Built for learning, interview preparation, and understanding the trade-offs behind the abstractions used every day.
Sensitive Words Detection 一个高性能的敏感词检测和过滤库,基于 Go 语言开发。专注于中文文本的敏感词检测,支持多种检测策略和灵活的扩展机制。
A comprehensive, reusable and efficient concurrent-safe generics utility functions and data structures library.
A Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching and string similarity.
Very fast C# implementation of Aho Corasick algorithm based on Double Array Trie.
Data Structures 👩💻 Domain on HackerRank - Problems & Solutions 📑📘
My solution codes for 400+ algorithms and data structure problems. Most common and famous interview placement questions from Data Structures and Algorithms.
Minimalistic trie implementation for autosuggest and autocomplete components
Algorithm Visualizer helps users to visualize different algorithms with vibrant graphics and colors 🤖 👨💻
A Radix Tree based router for HTTP and other routing needs with support for middlewares and endpoints with a Cython boost
This example shows the Aho-Corasick algorithm for multi-pattern search in Python. It builds a trie with failure links to scan text efficiently in linear time, detecting all occurrences of given patterns. The implementation is part of the 127 algorithms in Antivirus Engines: From Methods to Innovations, Design, and Applications.
SQL-based prefix tree implementation inspired by pygtrie and python-diskcache
Efficient, immutable and stack safe implementation of a Trie data structure in dart: autocomplete, text search, spell checking, strings and prefixes
Sequential IP address lookup in the routing table of routers has complexity O(n). This lookup can be reduced to O(1) time complexity, trading of with the space complexity which can be exponential in the worst case i.e. exp(2,33) - 1 on implementing tries.
:card_file_box: O objetivo deste trabalho é criar um corretor ortográfico utilizando uma árvore de prefixo.
A concurrent in-memory Adaptive Radix Tree (ART) featuring optimistic lock coupling
Data structure and Algorithms, Java workouts ,Problem Solving questions and solutions.(Repository contains major Graph alogirthms like Bellmanford algo,Prim's ,Dijkstra's algorithm).
🍃 Coded in 2 days as part of IBM interview process. Autocomplete with custom Trie algorithm in O(n) where n is the prefix length and vanilla JS AJAX at the client-side.