6 packages tagged with “Damerau”
A .NET port of java-string-similarity.
A library implementing different string similarity and distance measures. A dozen of algorithms (including Levenshtein edit distance and sibblings, Jaro-Winkler, Longest Common Subsequence, cosine similarity etc.) are currently implemented. Based upon F23.StringSimilarity
Library (.Net Standard 1.0) to support text and person name matching. 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
Simple and clean string metrics implementations: Hamming, Levenshtein and Damerau-Levenshtein
BlueSimilarity is a string similarity metric library with semantic learning optimized for speed and simple usage (edit distance - Levenshtein, Damerau-Levenshtein; Levenshtein, Damerau-Levenshtein, Jaro, Jaro-Winkler, Jaccard, Dice, Overlap, Semantic Bag of Words Similarity, TFIDF, SoftTFIDF)
Provides math metrics algorithms.