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.3.tar.gz
(5.8 kB
view hashes)
Built Distribution
Close
Hashes for levenshtein_rs-0.1.3-cp311-cp311-manylinux_2_28_x86_64.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 40ff4428b8e6df054abe4241561812c22f169a8ceecc36d477b8ae061f04b0db |
|
MD5 | cba2ce036c50079060602f51c99c13cb |
|
BLAKE2b-256 | f559ba777e3b6ccd810934952afcddee9566ca48f810bd6c77d8e082ed93be46 |