string_search_algorithms 1.0.0

String similarity and search library. Features instance-based engines, customizable normalization, and multiple algorithms (Levenshtein, Jaro-Winkler, KMP, etc.).

Changelog

All notable changes to this package will be documented in this file.

1.0.0

Added

• Initial stable release of the similarity and search libraries.
• Instance-based engines with configurable normalization and caching.
• Similarity algorithms: Dice, Levenshtein, Damerau-Levenshtein, OSA, Jaro, Jaro-Winkler, Cosine, Jaccard, Overlap, Tversky, N-gram, Hamming, LCS, Soundex, Metaphone.
• Substring search algorithms: KMP, Boyer-Moore, Rabin-Karp.
• CompiledPattern for repeated substring searches.
• Convenience String extension methods for similarity and search.
• Benchmark scripts under benchmark/.

Documentation

• Complete API documentation for all public members.
• Updated README with examples and configuration guidance.