2 This project attempts to adhere to [Semantic Versioning](http://semver.org).
4 ## [0.6.0] - (2016-12-26)
6 - Add optimal string alignment distance
9 - Fix Damerau-Levenshtein implementation (previous implementation was actually
10 optimal string alignment; see this [Damerau-Levenshtein explanation])
12 ## [0.5.2] - (2016-11-21)
14 - Remove Cargo generated documentation in favor of a [docs.rs] link
16 ## [0.5.1] - (2016-08-23)
18 - Add Cargo generated documentation
21 - Fix panic when Jaro or Jaro-Winkler are given strings both with a length of
24 ## [0.5.0] - (2016-08-11)
26 - Make Hamming faster (thanks @IBUzPE9) when the two strings have the same
27 length but slower when they have different lengths
29 ## [0.4.1] - (2016-04-18)
31 - Add Vagrant setup for development
32 - Add AppVeyor configuration for Windows CI
35 - Fix metrics when given strings with multibyte characters (thanks @WanzenBug)
37 ## [0.4.0] - (2015-06-10)
39 - For each metric, add a function that takes a vector of strings and returns a
40 vector of results (thanks @ovarene)
42 ## [0.3.0] - (2015-04-30)
44 - Remove usage of unstable Rust features
46 ## [0.2.5] - (2015-04-24)
48 - Remove unnecessary `Float` import from doc tests
50 ## [0.2.4] - (2015-04-15)
52 - Remove unused `core` feature flag
54 ## [0.2.3] - (2015-04-01)
56 - Remove now unnecessary `Float` import
58 ## [0.2.2] - (2015-03-29)
60 - Remove usage of `char_at` (marked as unstable)
62 ## [0.2.1] - (2015-02-20)
64 - Update bit vector import to match Rust update
66 ## [0.2.0] - (2015-02-19)
68 - Implement Damerau-Levenshtein
71 ## [0.1.1] - (2015-02-10)
73 - Configure Travis for CI
74 - Add rustdoc comments
77 - Limit Jaro-Winkler return value to a maximum of 1.0
78 - Fix float comparsions in tests
80 ## [0.1.0] - (2015-02-09)
82 - Implement Hamming, Jaro, Jaro-Winkler, and Levenshtein
84 [Unreleased]: https://github.com/dguo/strsim-rs/compare/0.6.0...HEAD
85 [0.6.0]: https://github.com/dguo/strsim-rs/compare/0.5.2...0.6.0
86 [0.5.2]: https://github.com/dguo/strsim-rs/compare/0.5.1...0.5.2
87 [0.5.1]: https://github.com/dguo/strsim-rs/compare/0.5.0...0.5.1
88 [0.5.0]: https://github.com/dguo/strsim-rs/compare/0.4.1...0.5.0
89 [0.4.1]: https://github.com/dguo/strsim-rs/compare/0.4.0...0.4.1
90 [0.4.0]: https://github.com/dguo/strsim-rs/compare/0.3.0...0.4.0
91 [0.3.0]: https://github.com/dguo/strsim-rs/compare/0.2.5...0.3.0
92 [0.2.5]: https://github.com/dguo/strsim-rs/compare/0.2.4...0.2.5
93 [0.2.4]: https://github.com/dguo/strsim-rs/compare/0.2.3...0.2.4
94 [0.2.3]: https://github.com/dguo/strsim-rs/compare/0.2.2...0.2.3
95 [0.2.2]: https://github.com/dguo/strsim-rs/compare/0.2.1...0.2.2
96 [0.2.1]: https://github.com/dguo/strsim-rs/compare/0.2.0...0.2.1
97 [0.2.0]: https://github.com/dguo/strsim-rs/compare/0.1.1...0.2.0
98 [0.1.1]: https://github.com/dguo/strsim-rs/compare/0.1.0...0.1.1
99 [0.1.0]: https://github.com/dguo/strsim-rs/compare/fabad4...0.1.0
100 [docs.rs]: https://docs.rs/strsim/
101 [Damerau-Levenshtein explanation]:
102 http://scarcitycomputing.blogspot.com/2013/04/damerau-levenshtein-edit-distance.html