МГТУ ИУ7 "Анализ алгоритмов" лабораторные работы

This package allow use strings operations to generic sequence

Turkish language spell checker GUI application

Takes words from the user and checks if it is spelled correctly according to a wordlist containing the 10000 most used English words.

Dynamic Programming code for MO640 course

A simple autocorrect tool that can be used on Windows systems.

Here Is Program To Check The Spelling And Correction in Spelling mistake suggester

Project created for CSC 245. The project is a working spell checker that checks if a word is spelled wrong and if so it suggests a replacement. We utilized the levenshtein edit distance algorithm and a txt of 100k words to build this project

Java implementation of global alignment using a variation of Levenshteindistance. It takes first two sequences from fasta file and returns aligned sequences also in fasta format.

The Java Spell Checker is an application designed to assist users in detecting and rectifying misspelled words within a specified text file.

Projeto de LP II e EDB II com Árvore Trie de Prefixos

Spell Checking for bad casing and invalid character duplication

API to get a word similarity in a given text using the Levenshtein algorithm.

A fuzzy search algorithm for finding duplicate entries in a csv file

Edit Distance Problem

Implementation serial of Levenshtein distance algorithm.

A parameterizable Damerau Levenshtein aligner in Java.

Algorithms and Data Structures a comprehensive collection of fundamental Algorithms and Data structures organized into various categories to cater to the needs of software engineers and computer science students.