265 Open source projects that are alternatives of or similar to aho-corasick-node

fuzzy string matching in R

Competitive Programming templates that I used during the past few years.

C++17 implementation of memory-efficient dynamic tries

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.

Algorithmic Problems Solutions -- hash table code featured in geeksforgeeks

a dynamic Agile.NET string decryptor that relies on invoke by wwh1004 | Version : 6.X

Contains solutions and codes to various online competitive programming challenges and some good problems. The links to the problem sets are specified at the beginning of each code.

An efficient dynamically sized string buffer (aka String Builder) for AssemblyScript

Change any string case to PascalCase/camelCase/kebab-case/snake_case

🔨 Make all objects to String!

Interpolate strings with HTML comment markers!

Golang metrics for calculating string similarity and other string utility functions

Provides lexical scanning operations on a String

A memory efficient string type that can store up to 24* bytes on the stack

Radix trees in Rcpp and R

Flexible Algorithms for Image Registration

The module allows to translate numbers into a text equivalent. This is important in the billing.

Fastest Trie structure (Linux & Windows)

👣 Nano string template library for modern, based on ES6 template string syntax.

Is this value a JS String object or primitive? This module works cross-realm/iframe, and despite ES6 @@toStringTag.

Erasure coding (Reed–Solomon coding) in Go

ES5 spec-compliant shim for String.prototype.trim

Programming👨‍💻 Questions on BinarySearch💻, LeetCode💻, CodeChef💻, Codeforces💻,DSA 450

♨️ Detailed Java & Python solution of LeetCode.

Convert string to camel case, snake case, kebab case / slugify, custom delimiter, pad string, tease string and many other functionalities with help of by Stringy package.

Obfuscate string literals in JavaScript code.

Speedy Net, Speedy Match and Speedy Composer

📝 Provides a simple API to normalize texts, whitespaces, paragraphs & diacritics.

Data Structures & Algorithms. Includes solutions for Cracking the Coding Interview 6th Edition

Extra string functions for OCaml

A prefix tree (trie) implementation in go

SixArm.com » Ruby » Unaccent replaces a string's accented characters with ASCII characters.

Evaluates a math expression from a string. Supports variables and custom operators.

Golang radix tree implementation

`in` operator for go

Split a string on the first occurrence of a given separator

Elegant text formatting tool in Swift 🔥

Golang identification and matching of system fonts

A better Jest snapshot serializer for plain html strings

str is a string module with useful methods that don't exist in Lua's core

Fast IP lookup table for IPv4/IPv6 prefixes

Python-style format strings for Julia

gome- Golang Match Engine, uses Golang for calculations, gRPC for services, ProtoBuf for data exchange, RabbitMQ for queues, and Redis for cache implementation of high-performance matching engine microservices/ gome-高性能撮合引擎微服务

Unescape special characters encoded by JavaScript escape sequences

An easy encryptor / decryptor for iOS

Unicode code points support for Clojure

Create a table from an array of objects

Welcome to Snowman App – a Data Matching Benchmark Platform.

Is the typeof value a javascript primitive?

just for fun

This repository implements skeleton matching algorithm.

Audio Synchronization and Analysis Tool

[ICCV17] DeepCD: Learning Deep Complementary Descriptors for Patch Representations

A minimal and powerful trie based url path router (or mux) for Go.

Lightweight string similarity function for javascript

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

An open-source NLP library: fast text cleaning and preprocessing

A small, dependency-free and strongly typed template engine.

A Reason implementation of the blossom maximum-matching algorithm

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