In information theory, linguistics, and computer science, the Levenshtein distance is a string metric for measuring the difference between two sequences. 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.
Levenshtein distance may also be referred to as edit distance, although that term may also denote a larger family of distance metrics known collectively as edit distance.
This repository consists of a Visual Studio solution with three projects:
- LevenshteinDistance.Core: The main with the algorithm implementation/class
- LevenshteinDistance.Blazor: A Blaazor app with a demo autocomplete list of countries
- LevenshteinDistance.Tests: MSTest project with a few basic tests to run and debug to understand how it works
- Visual Studio, Visual Studio Code, etc
- .NET 6
- Spell checking
- Speech recognition
- DNA analysis
- Plagiarism detection
dotnet test
- Adam Stirtan - adamstirtan
This project is licensed under the MIT License - see the LICENSE file for details