This repo contains different university projects made by me, Alessio Mana and Fabrizio Sanino for our Algorithm and Data Structure Exam done in Turin in June 2021.
-
Updated
Feb 8, 2023 - C
This repo contains different university projects made by me, Alessio Mana and Fabrizio Sanino for our Algorithm and Data Structure Exam done in Turin in June 2021.
Python scripts used to calculate 3 basic similarity measures, suitable for ad hoc information retrieval systems: Levenshtein Edit Distance, Jaccard, and a Term-Document matrix.
English auto-correct using edit distance algorithm. Edit distance is a dynamic programming based algorithm. Words with edit distance value 1 closest to entered word is chosen from the dictionary of 1000 words and then displayed.
This is a problem which is asked to solve in my Data Structure & Algorithm Lab.
Script for calculating the edit distance between two strings. We compare two approaches in terms of computational time: linear storage and quadratic storage.
Implementing Edit Distance in C
Compute shortest edit-distance path between two words
Calculates the edit distance between two strings
An implementation of a spell checker that uses a corpus file to compute word probabilities and suggests corrections for misspelled words by applying edit operations like delete, swap, replace, and insert.
Edit-distance algorithm for text-processing and scoring for each sentiment (+1, 0, -1).
Implimentation of the minimum edit distance algorithm for a simple spell checker.
Finding edit distance between a correct and an incorrect string
Comparing edit distance with n-grams
This is the edit distance calculated between two strings (C++)
Spell Checker using a Hash Table
Exercises in C and Java carried out for the laboratory course of algorithms and data structures at the University of Turin
단국대학교 알고리즘 과제
This program takes an input and outputs a list of similarly spelled words based on edit distance using the Dynamic Edit Distance algorithm.
In the Edit Distance problem, we need to find the minimum number of edits or operations required to make two strings equal.
Dynamic programming solution to the "Edit Distance" problem.
Add a description, image, and links to the edit-distance-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the edit-distance-algorithm topic, visit your repo's landing page and select "manage topics."