https://github.com/farhaduneci/editdistance

The Levenshtein distance algorithm implementation
https://github.com/farhaduneci/editdistance

dynamic-programming python3

Last synced: about 2 months ago
JSON representation

The Levenshtein distance algorithm implementation

• Host: GitHub
• URL: https://github.com/farhaduneci/editdistance
• Owner: Farhaduneci
• License: mit
• Created: 2022-06-21T15:46:31.000Z (over 2 years ago)
• Default Branch: main
• Last Pushed: 2022-06-21T15:57:56.000Z (over 2 years ago)
• Last Synced: 2023-03-05T04:53:27.649Z (almost 2 years ago)
• Topics: dynamic-programming, python3
• Language: Python
• Homepage:
• Size: 3.91 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README
  • License: LICENSE

Awesome Lists containing this project

README

        
Informally, the Levenshtein distance between two words is the minimum number of single-character edits

(insertions, deletions or substitutions) required to change one word into the other.

It is named after the Soviet mathematician Vladimir Levenshtein, who considered this distance in 1965.

This application calculates the required operations and also prints them:

> Demo:

Enter Start String: Farhad

Enter Ending String: Farzad

Edit Distance between `Farhad` and `Farzad` is: 2

Operations performed are:

 Operations on Start String:

   Char 'F' -> No Operation

   Char 'a' -> No Operation

   Char 'r' -> No Operation

   Char 'h' -> Substitution

   Char 'a' -> No Operation

   Char 'd' -> No Operation

 Operations on Ending String:

   Char 'F' -> No Operation

   Char 'a' -> No Operation

   Char 'r' -> No Operation

   Char 'z' -> Substitution

   Char 'a' -> No Operation

   Char 'd' -> No Operation