Web application for retrieving tweet data using Knuth–Morris–Pratt and Boyer–Moore algorithms for the string matching.

Assignments for the course CSD303 Theory Of Computation

📖 Aho-corasick Algorithm based multiple keyword matcher with KMP

The repository contains the code for various algorithms and coding techniques.

Implementation of the Aho-Corasick multiple pattern matching finite state automaton.

Soft string matching routines, with some accompanying datasets.

A Java 8 string manipulation library.

Algorithm for the derivation of the top-K string alignments, based on the Levenshtein distance.

SQL Map in CORE JAVA

A BK tree for fast, fuzzy, in-memory string matching

Java toolkit for multi-threaded preprocessing of extremely large .fastq files in the GBS Pipeline by demultiplexing, filtering, and trimming sequenced DNA.

HeadlineTextProcessor

Created modified Levenshtein distance algorithms, to match strings by deletion and capitalization only and does not allow replacement or insertion of characters

Input String end with second string

Compare String matching algorithms emprically: Knuth Morris Pratt and Rabin Karp

String frequency manager.

Projected implemented 4 different Top K Sub string matching algorithms from a conference paper using the dblp dataset.There is a wide range of applications that require to query a large database of texts to search for similar strings or substrings. Traditional approximate substring matching requests a user to specify a similarity threshold