Info
| Version: | 1.0.0 |
| Author(s): | Jacek Szybisz |
| Last Update: | Thursday, September 13, 2018 |
| .NET Fiddle: | Create the first Fiddle |
| Project Url: | https://github.com/jszybisz/FuzzyMatch |
| NuGet Url: | https://www.nuget.org/packages/JacekSzybisz.FuzzyMatch |
Install
Install-Package JacekSzybisz.FuzzyMatch
dotnet add package JacekSzybisz.FuzzyMatch
paket add JacekSzybisz.FuzzyMatch
JacekSzybisz.FuzzyMatch Download (Unzip the "nupkg" after downloading)
Dependencies
Tags
It uses Levenshtein Distance algorithms to perform this operation.
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.[1]
https://en.wikipedia.org/wiki/Levenshtein_distance
Levenshtein distance may also be referred to as edit distance, although that term may also denote a larger family of distance metrics.[2]:32 It is closely related to pairwise string alignments.