Info
| Version: | 2.0.3 |
| Author(s): | Steve Hatchett |
| Last Update: | Wednesday, April 4, 2018 |
| .NET Fiddle: | Online Example |
| Project Url: | https://github.com/softwx/SoftWx.Match |
| NuGet Url: | https://www.nuget.org/packages/SoftWx.Match |
Install
Install-Package SoftWx.Match
dotnet add package SoftWx.Match
paket add SoftWx.Match
SoftWx.Match Download (Unzip the "nupkg" after downloading)
Dependencies
- NETStandard.Library(>= 1.6.1)
Tags
Currently contains Levenshtein and Damerau-Levenshtein (optimal string alignment version) edit distance and normalized similarity functions optimized for speed and reduced memory consumption.
There are also versions of the functions that accept a maximum desired distance or minimum desired similarity, which can result in significantly faster speeds, particularly for long strings. This is one of the faster C# implementations available (possibly the fastest for non-trivial strings).
See the associated GitHub project for more detail.
MIT License.