Prepared for v0.4 release

Author: mbrlabs

CHANGES

@@ -1,5 +1,5 @@
-[0.4.0]
-
+[0.4.0] ~ 10/07/2016
+- Added:    Sift3 distance + tests
 
 [0.3.0] ~ 30/06/2016
 - Added:    Damerau Levenshtein distance + tests

Cargo.toml

@@ -1,6 +1,6 @@
 [package]
 name = "distance"
-version = "0.3.0"
+version = "0.4.0"
 authors = ["Marcus Brummer <mbrlabs7@gmail.com>"]
 
 description = "A collection of approximate string matching algorithms"

README.md

@@ -1,7 +1,7 @@
 # distance 
 [![](https://travis-ci.org/mbrlabs/distance.svg?branch=master)](https://travis-ci.org/mbrlabs/distance) 
 [![](https://img.shields.io/crates/v/distance.svg)](https://crates.io/crates/distance)
-[![](https://img.shields.io/badge/docs-v0.3.0-blue.svg)](https://mbrlabs.github.io/distance)
+[![](https://img.shields.io/badge/docs-v0.4.0-blue.svg)](https://mbrlabs.github.io/distance)
 
 This is a rust library for approximate string matching algorithms.   
 Possible applications for this are fuzzy string searching, spell checkers, spam filters, etc.
@@ -19,7 +19,7 @@ distance is available on [crates.io](https://crates.io/crates/distance).
 
 ```toml
 [dependencies]
-distance = "0.3"
+distance = "0.4"
 ```
 
 ## Usage

src/sift3.rs

@@ -15,7 +15,7 @@
 /// Calculates the sift3 distance between two strings with a default max_distance of 5.
 /// 
 /// # Sift3
-/// (Sift3)[http://siderite.blogspot.com/2007/04/super-fast-and-accurate-string-distance.html] - super fast and accurate string distance algorithm.
+/// [Sift3](http://siderite.blogspot.com/2007/04/super-fast-and-accurate-string-distance.html) - super fast and accurate string distance algorithm.
 /// The higher the return value, the more different the two strings are. 
 /// A value of 0.0 means both strings are equal.
 ///