Description:

ukkonenrs 0.1.0.post1

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

License

For personal and professional use. You cannot resell or redistribute these repositories in their original state.

Share

• Share on Facebook
• Share on Twitter