weighted_levenshtein 0.2.0

Generic implementation of Levenshtein distance allowing arbitrary weighting of operations
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

# THIS FILE IS AUTOMATICALLY GENERATED BY CARGO
#
# When uploading crates to the registry Cargo will automatically
# "normalize" Cargo.toml files for maximal compatibility
# with all versions of Cargo and also rewrite `path` dependencies
# to registry (e.g., crates.io) dependencies
#
# If you believe there's an error in this file please file an
# issue against the rust-lang/cargo repository. If you're
# editing this file be aware that the upstream Cargo.toml
# will likely look very different (and much more reasonable)

[package]
edition = "2018"
name = "weighted_levenshtein"
version = "0.2.0"
authors = ["Benjamin Levin <bplevin36@gmail.com>"]
description = "Generic implementation of Levenshtein distance allowing arbitrary weighting of operations"
homepage = "https://github.com/bplevin36/weighted_levenshtein"
readme = "README.md"
keywords = ["levenshtein", "weighted"]
categories = ["algorithms", "text-processing"]
license = "MIT"
repository = "https://github.com/bplevin36/weighted_levenshtein"
[dev-dependencies.unicode-segmentation]
version = "1.3.0"

[features]
default-weight = []