Simple, fast Levenshtein distance and similarity ratio for Ruby
-
Updated
Dec 8, 2023 - C
Simple, fast Levenshtein distance and similarity ratio for Ruby
Implementations of most algorithms learnt in the course UE18CS311
1st year master project: Implementation, in C, of the Knuth Morris Pratt and the Boyer Moore algorithms for finding strings in texts. (no documentation))
Algorithmic Design - master's degree course
C Library of Aho-Corasick Algorithm based on Coordinate Hash Trie
This repository contains my implementation of parallelized Aho-Corasick algorithm. It was developed as a project for my Multicore Programming course
C language algo
Copy from http://git.netfilter.org/ipset/
Libmystr: C Library for Efficient String Manipulation.
1st year master project: Create a suffix tree to find the longest substring common to N texts
A small repository containing the implementations of the algorithms seen in the course of Advanced Algorithms at Udine University
Program to generate term-biased snippets for paragraphs of text
An experiment with string fiddling in C. Is the C++ std::string_view abstraction a good fit for C?
A simple C string lib
String Kernel with time complexity of O(n)
An experiment in optimizing a string counter.
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."