Qwerty-Jaro–Winkler distance is a tweak on top of jaro winkler edit distance where we try to consider distance between keys in keyboard while calculating number of matches.
-
Updated
Aug 14, 2017 - Java
#
edit-distance-algorithm
Here are 8 public repositories matching this topic...
XDP is a tool in Java 8 which compares XML documents (Structure and Content), returns the similarity, provides a diff file which can be used to patch the 1st XML producing the 2nd.
-
Updated
Mar 4, 2021 - Java
Editing distance algorithm realisation
-
Updated
Apr 23, 2022 - Java
Created modified Levenshtein distance algorithms, to match strings by deletion and capitalization only and does not allow replacement or insertion of characters
levenshtein-distance duplicates-removed string-matching levenshtein-algorithm edit-distance-algorithm modified-levenshtein levenshtein-deletion-only character-duplication delete-only-levenshtein weighted-levenshtein
-
Updated
Apr 4, 2019 - Java
This is a problem which is asked to solve in my Data Structure & Algorithm Lab.
-
Updated
Apr 17, 2023 - Java
단국대학교 알고리즘 과제
algorithm graph-algorithms sorting-algorithms huffman-algorithm edit-distance-algorithm recursion-algorithm
-
Updated
Jul 9, 2021 - Java
Implimentation of the minimum edit distance algorithm for a simple spell checker.
-
Updated
Aug 3, 2021 - Java
Dynamic programming solution to the "Edit Distance" problem.
java algorithms leetcode hackerrank edit-distance leetcode-solutions dynamic-programming hackerrank-solutions edit-distance-algorithm
-
Updated
Jun 29, 2022 - Java
Improve this page
Add a description, image, and links to the edit-distance-algorithm topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the edit-distance-algorithm topic, visit your repo's landing page and select "manage topics."