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.
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.5.tar.gz
(5.8 kB
view hashes)
Built Distribution
Close
Hashes for levenshtein_rs-0.1.5-cp311-cp311-manylinux_2_28_x86_64.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 5249319dae9a7e5fc3bd0bfe4711e6bc7dffb8a71327d10c9d266959255472fa |
|
MD5 | 94af23a4d59551375676262b983d2551 |
|
BLAKE2b-256 | 53224ba8f08b1535578ef19ca5a9116c2869ff9cc1e43de8ac8def29c4ffc5e0 |