An efficient indexing data structure for string similarity search
Project description
FastSS is an efficient indexing data structure for string similarity search, invented by researchers at Zurich University in 2007.
TinyFastSS is a simple Python implementation of FastSS, written in less than 300 LoC.
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
TinyFastSS-v2.0.1.tar.gz
(3.7 kB
view details)
File details
Details for the file TinyFastSS-v2.0.1.tar.gz.
File metadata
- Download URL: TinyFastSS-v2.0.1.tar.gz
- Upload date:
- Size: 3.7 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
2ac8c063b695f16429f03f80c176a725651d1a6125d7e6d4d732afa14c554bac
|
|
| MD5 |
2ed483bacb9bed8f20d84da2c62c34dc
|
|
| BLAKE2b-256 |
14095bdc5dc56105bde305cf52694e723b3762dd509ede211438b47296f3de5b
|
