Simple, robust, and convenient read-only string handling in C.

Up to 100x faster strings for C, C++, CUDA, Python, Rust, Swift, JS, & Go, leveraging NEON, AVX2, AVX-512, SVE, GPGPU, & SWAR to accelerate search, hashing, sorting, edit distances, sketches, and memory ops 🦖

A fast multiple string replace library for ruby. Uses a C implementation of the Aho–Corasick Algorithm based on https://github.com/morenice/ahocorasick while adding support for on the fly multiple string replacement. Faster alternative to String.gsub when dealing with non-regex (exact match) use cases

Create my own library and redo a set of functions from the C standard library.

C Library of Aho-Corasick Algorithm based on Coordinate Hash Trie

A simple and efficient regular expression implementation

Hive Helsinki Ecole 42 curriculum project libft

Safeclib - Memory-safe C library providing secure string/memory operations with bounds checking, overflow prevention, and modular design. Available as static/shared libraries.

Assignments on Analysis and Design of Algorithm

Aho-Corasick automation for large-scale multi-pattern matching. Available for C/C++, Python, and Java on Linux, macOS, and Windows.

Regular Expression Parser coded in C programming language.

This repository contains my implementation of parallelized Aho-Corasick algorithm. It was developed as a project for my Multicore Programming course

[Ranked No. 1🥇] My solution for the course project of Datastructure 2019'Spring @ BUAA (北航数据结构). Plenty of C language tricks, hacks, and optimizations are used for extreme efficiency. *Ranked 1/800* in the efficiency test.

Simple, fast Levenshtein distance and similarity ratio for Ruby

String Kernel with time complexity of O(n)

Program to generate term-biased snippets for paragraphs of text

Libmystr: C Library for Efficient String Manipulation.

Third practical work of "Algorythms and Data Structures III" subject

Implementations of most algorithms learnt in the course UE18CS311

Generating auto-correction suggestions using keyboard user-input by traversing the suffix trie based on the user input data so far and offering the most-likely string outcome based on a simplistic counter mechanism to track the user’s most used paths taken based on that scenario (similarly to a fusion tree)