Skip to content
#

levenshtein-distance

Here are 136 public repositories matching this topic...

Python port of SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm

  • Updated Mar 29, 2026
  • Python

Python implementation of several sequence alignment algorithms such as Waterman-Smith-Beyer, Gotoh, and Needleman-Wunsch intended to calculate distance, show alignment, and display the underlying matrices.

  • Updated Mar 2, 2026
  • Python

Improve this page

Add a description, image, and links to the levenshtein-distance topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the levenshtein-distance topic, visit your repo's landing page and select "manage topics."

Learn more