eddie 0.4.1

Fast and well-tested implementations of edit distance/string similarity metrics: Levenshtein, Damerau-Levenshtein, Hamming, Jaro, and Jaro-Winkler.
Documentation 
[[bench]]
harness = false
name = "leven"

[[bench]]
harness = false
name = "damlev"

[[bench]]
harness = false
name = "hamming"

[[bench]]
harness = false
name = "jaro"

[[bench]]
harness = false
name = "jarwin"

[dependencies]
[dev-dependencies.criterion]
version = "0.3"

[dev-dependencies.distance]
version = "0.4"

[dev-dependencies.edit-distance]
version = "2.1.0"

[dev-dependencies.natural]
version = "0.3"

[dev-dependencies.rand]
version = "0.7"

[dev-dependencies.strsim]
version = "0.9"

[dev-dependencies.txtdist]
version = "0.2"

[package]
authors = ["Ilia Schelokov <thaumant@gmail.com>"]
categories = ["algorithms", "text-processing"]
description = "Fast and well-tested implementations of edit distance/string similarity metrics:\nLevenshtein, Damerau-Levenshtein, Hamming, Jaro, and Jaro-Winkler.\n"
documentation = "https://docs.rs/eddie/"
edition = "2018"
homepage = "http://github.com/thaumant/eddie"
keywords = ["levenshtein", "hamming", "jaro", "text"]
license = "MIT"
name = "eddie"
repository = "http://github.com/thaumant/eddie"
version = "0.4.1"