Fast approximate edit distance.
Project description
ukkonen
Implementation of a bounded Levenshtein distance by Esko Ukkonen in "Algorithms for approximate string matching" in Rust, with Python bindings.
The implementation is based on the JS implementation. You can find the license in the LICENSE file.
Install
pip install ukkonen-rs
Build
First you should install Rust from rustup.rs. Then, you can build a wheel for your platform and install it:
pip install maturin
maturin build --release --cargo-extra-args="--features python"
pip install --no-index --find-links=target/wheels ukkonen_rs
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 Distributions
No source distribution files available for this release.See tutorial on generating distribution archives.
Built Distributions
Close
Hashes for ukkonen_rs-0.1.0.post1-cp36-abi3-win_amd64.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | a436743c66188277d3cd8023d003bf98f3558a3bed623ee6dbb047e8f62bc751 |
|
| MD5 | e744c9e661bde44356e7e9ca52b3cb4e |
|
| BLAKE2b-256 | 94a59e6a3e3c7b3e2284235c562c99c07332919de9437137ad57d3507161438c |
Close
Hashes for ukkonen_rs-0.1.0.post1-cp36-abi3-manylinux_2_5_x86_64.manylinux1_x86_64.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | f23a2397f54d56acd7c763f0dbfabe590901d96c08dd56ef9affaf18771c03dd |
|
| MD5 | 457922ff16ebd76cd2bf234e51ce8487 |
|
| BLAKE2b-256 | 7ab184b0508a47b066b3e07f0419a8ee1fd0feb731edc39b97987f6484e25092 |
Close
Hashes for ukkonen_rs-0.1.0.post1-cp36-abi3-macosx_10_7_x86_64.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 52d98e66de593603f63de80b516b02aba797b91a0b797645fcdd6d1f1e5610b7 |
|
| MD5 | e0f0435a517284e24f582051e5147472 |
|
| BLAKE2b-256 | 02f269f09074157ac825312a53e7064d78c1636bee5e036f721d1b9f4a14f7db |
