Lightning fast spell correction / fuzzy search library based on SymSpell by Commerce-Experts

Accelerating the deduplication and collapsing process for reads with Unique Molecular Identifiers (UMI). Heavily optimized for scalability and orders of magnitude faster than a previous tool.

A Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching and string similarity.

A program that compares 2 text documents and summarizes the results in a similarity report

A general, multi-threaded fuzzy searching language, called fuzzysplit, that is built on top of a fast and flexible Java fuzzy search library. Can be applied to demultiplex and trim DNA.

JavaFX application for detecting similarity between Python source code files using Levenshtein distance as a metric.

In this project I am using the tf - idf algorithm and cosine similarity to find the similarity of two strings.

Created a search engine with functionalities such as counting the frequency of words using Boyer Moore, Brute Force Algorithm, Web Page Ranking using Quicksort Algorithm, spell checking and suggestion using Edit Distance algorithm and Java, HTML to TEXT converter using Jsoup converter