No project description provided
Project description
levenshtein_rs
Given x: list[str]
and y: list[str]
, this package calculates the Levenshtein distance between a
and b
.
Usage
from levenshtein_rs import levenshtein_list
a = "Testing one two three"
b = "one two three four"
print(levenshtein_list(a.split(), b.split()))
# 2
This project uses the MIT license.
Building from source
This is a Rust project wrapped with maturin.
nix develop
will install dependencies (direnv is supported). Alternatively, you can install cargo using rustup and install maturin using pip.
maturin develop
will compile the project and install it into the current Python environment.
maturin publish
will publish to PyPi.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
levenshtein_rs-0.1.6.tar.gz
(6.5 kB
view hashes)
Built Distribution
Close
Hashes for levenshtein_rs-0.1.6-cp311-cp311-manylinux_2_28_x86_64.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 8cbd0966f962545cad645559478ec899e71aab0e84d03d2630f1e78bbbab870e |
|
MD5 | 6fcdde28314f1f46cb7cc001793957d2 |
|
BLAKE2b-256 | 1b1ce474f01725cdc1c38d1a56beb1223593fcb684200b075237b3d2514dfd48 |