pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.
-
Updated
May 2, 2024 - Python
#
edit-distance-algorithm
Here are 12 public repositories matching this topic...
Cython implementation of true Damerau-Levenshtein algorithm.
-
Updated
Nov 29, 2023 - Python
A package for parsing Vietnamese address
-
Updated
May 9, 2024 - Python
To evaluate machine translation, they use several methods, some of which we fully implemented
python jupyter-notebook n-grams edit-distance bleu-score edit-distance-algorithm gleu-score wer-score nist-score chrf-score meteor-score
-
Updated
Mar 4, 2025 - Python
Academy
python algorithm dynamic-programming academy edit-distances edit-distance-algorithm distance-matrix min-edit-distance minimum-edit-distance
-
Updated
Nov 19, 2022 - Python
Script for calculating the edit distance between two strings. We compare two approaches in terms of computational time: linear storage and quadratic storage.
-
Updated
Jun 26, 2015 - Python
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.
-
Updated
May 12, 2021 - Python
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.
information-retrieval jaccard-similarity levenshtein-algorithm edit-distance-algorithm document-term-matrix
-
Updated
Jul 23, 2021 - Python
Comparing edit distance with n-grams
-
Updated
Apr 11, 2022 - Python
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.
-
Updated
Jun 14, 2023 - Python
This program takes an input and outputs a list of similarly spelled words based on edit distance using the Dynamic Edit Distance algorithm.
-
Updated
Feb 18, 2022 - Python
Accelerating Levenshtein Edit Distance Using GPU and PyCUDA
python parallel-computing high-performance-computing gpu-acceleration edit-distance-algorithm pycuda
-
Updated
Aug 27, 2024 - Python
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."