An experiment with string fiddling in C. Is the C++ std::string_view abstraction a good fit for C?
-
Updated
May 30, 2024 - C
An experiment with string fiddling in C. Is the C++ std::string_view abstraction a good fit for C?
A simple and efficient regular expression implementation
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
I had to create my own library and redo a set of functions from the C standard library.
String Kernel with time complexity of O(n)
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
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
C Library of Aho-Corasick Algorithm based on Coordinate Hash Trie
Aho-Corasick automation for large-scale multi-pattern matching. Available for C/C++, Python, and Java on Linux, macOS, and Windows.
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)
Faster and safer algorithms for string matching with wildcards, globs, and gitignore-style globs
Levenshtein algorithm in C
The problem statement is regarding a Global Airports Management System.The different airports are connected to each other by means of edges. These form a graph where the airports are the nodes and the edges between the airports represent the connections. Different problems have been posed, regarding graph traversal, sorting, DFS, and MST. Soluti…
1st year master project: Create a suffix tree to find the longest substring common to N texts
1st year master project: Implementation, in C, of the Knuth Morris Pratt and the Boyer Moore algorithms for finding strings in texts. (no documentation))
Add a description, image, and links to the string-matching topic page so that developers can more easily learn about it.
To associate your repository with the string-matching topic, visit your repo's landing page and select "manage topics."