generic_levenshtein 0.2.1

Generic and fast implementation of the Levenshtein distance
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46

[[bench]]
harness = false
name = "benches"
path = "benches/benches.rs"

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

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

[dev-dependencies.eddie]
version = "0.4.2"

[dev-dependencies.fuzzy-search]
version = "0.1.0"

[dev-dependencies.levenshtein]
version = "1.0.4"

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

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

[lib]
name = "generic_levenshtein"
path = "src/lib.rs"

[package]
authors = ["Jerome M. Berger <jeberger@free.fr>"]
autobenches = false
autobins = false
autoexamples = false
autolib = false
autotests = false
build = false
categories = ["algorithms", "text-processing"]
description = "Generic and fast implementation of the Levenshtein distance"
edition = "2021"
homepage = "https://heptapod.host/jmb/rust_generic_levenshtein"
license = "MIT"
name = "generic_levenshtein"
readme = "README.md"
version = "0.2.1"