https://github.com/emmatyping/ukkonen
A port of https://github.com/sunesimonsen/ukkonen to Rust, for use in Python
https://github.com/emmatyping/ukkonen
Last synced: 3 months ago
JSON representation
A port of https://github.com/sunesimonsen/ukkonen to Rust, for use in Python
- Host: GitHub
- URL: https://github.com/emmatyping/ukkonen
- Owner: emmatyping
- License: other
- Created: 2021-11-19T10:15:13.000Z (over 3 years ago)
- Default Branch: main
- Last Pushed: 2021-12-01T09:39:57.000Z (over 3 years ago)
- Last Synced: 2025-03-15T05:38:44.736Z (3 months ago)
- Language: Rust
- Size: 23.4 KB
- Stars: 1
- Watchers: 2
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
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](https://github.com/sunesimonsen/ukkonen). You can find the license in the `LICENSE` file.
## Install
```bash
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:
```bash
pip install maturin
maturin build --release --cargo-extra-args="--features python"
pip install --no-index --find-links=target/wheels ukkonen_rs
```