86 Open source projects that are alternatives of or similar to lexpy

DAWG String Dictionary in C#

.NET Implementations of Trie Data Structures for Substring Search, Auto-completion and Intelli-sense. Includes: patricia trie, suffix trie and a trie implementation using Ukkonen's algorithm.

🔑A high performance Key/Value store written in Go with a predictable read/write performance and high throughput. Uses a Bitcask on-disk layout (LSM+WAL) similar to Riak.

Project is in active development and has been moved to the EthereumJS VM monorepo.

A Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching and string similarity.

A collection of common algorithms and data structures implemented in java, c++, and python.

The Capsule Hash Trie Collections Library

This Python module can be used to obtain antonyms, synonyms, hypernyms, hyponyms, homophones and definitions.

Java autocomplete library.

C++17 implementation of memory-efficient dynamic tries

A Node implementation of the Aho-Corasick string matching algorithm based on DoubleArray Trie.

An idiomatic and fast QP-trie implementation in pure Rust.

⚡️ A lightning fast HTTP router

⚡️ Lightning fast URL routing in Python (trie router)

Fast compressed trie dictionary library

C++ implementation of a fast and memory efficient HAT-trie

Surprisingly space efficient trie in Golang(11 bits/key; 100 ns/get).

코딩테스트 대비 문제집(Baekjoon Online Judge)

My take on an efficient implementation of a Trie in Javascript

Muxie is a modern, fast and light HTTP multiplexer for Go. Fully compatible with the http.Handler interface. Written for everyone.

Data-Structures using C++.

Compact tries for fixed-width keys

Garbage collector-sensitive patricia tree for IP/CIDR tagging

Golang Keyword extraction/replacement Datastructure using Tries instead of regexes

Golang radix tree implementation

Radix trees in Rcpp and R

Concurrent trie-hash map library

Algo-Tree is a collection of Algorithms and data structures which are fundamentals to efficient code and good software design. Creating and designing excellent algorithms is required for being an exemplary programmer. It contains solutions in various languages such as C++, Python and Java.

libgenerics is a minimalistic and generic library for C basic data structures.

Automatically exported from code.google.com/p/dawgdic

Minimalistic trie implementation for autosuggest and autocomplete components

Template Library of Data Structures in C++17

Universal database layer for the client, server & mobile devices. It's like Lego for databases.

A WEKA package for analyzing emotion and sentiment of tweets.

Python module (C extension and plain python) implementing Aho-Corasick algorithm

PATRICIA, Double Array, LOUDS Trie implementations for Java

leetcode.com , algoexpert.io solutions in python and swift

The lib CBioInfCpp.h contains 3 groups of functions for C++: "Input-Output", "Working with strings", "Working with graphs". Data structures "Adjacency vector" and "Adjacency map" are implemented in the last one (i.e. in "Working with graphs"). See About_CBioInfCpp for details.

Go datastructures.

Data Structures and Algorithms in Java

敏感词查找,验证,过滤和替换 🤓 FindAll, Validate, Filter and Replace words.

A modern, interlingual wordnet interface for Python

Go efficient multilingual NLP and text segmentation; support english, chinese, japanese and other. Go 高性能多语言 NLP 和分词

Algorithmic Problems Solutions -- hash table code featured in geeksforgeeks

Create and modify trie prefix structures and extract word lists including prefixes, anagrams and sub-anagrams

A collection of powerful data structures

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.

Swift Collection Data Structures Library

Fast, efficient, in-memory Full Text Search for Kotlin

Performance shootout of various trie implementations

Efficient Trie-based regex unions for blacklist/whitelist filtering and one-pass mapping-based string replacing

A C++ library providing fast language model queries in compressed space.

just for fun

🇨🇳Open Chinese Convert is an opensource project for conversion between Traditional Chinese and Simplified Chinese.(java 中文繁简体转换)

A fast and space efficient Radix tree in Java

Ergonomic trie data structure

Trie (a.k.a. prefix tree) C# implementation. Has constant-time string prefix lookup.

A golang http router based on trie tree.

High-quality LeetCode solutions

neato compression for key-value data