ocramz/ncd-tree

text similarity search trees based on Normalized Compression Distance

31
/ 100
Emerging

This is a Haskell library for developers who need to find how similar different pieces of text or data sequences are. It takes a collection of documents or data and builds an index, then allows you to query that index to quickly find the most similar items to a given input. This is ideal for developers building applications that require comparing data based on its underlying structure, without needing to understand the content itself.

Use this if you are a Haskell developer building an application that needs to quickly find similar text snippets, code fragments, or data sequences without extensive feature engineering.

Not ideal if you are not a Haskell developer or if your application requires a precise, exhaustive search rather than an approximate one.

text-similarity sequence-matching information-retrieval data-indexing haskell-development
No Package No Dependents
Maintenance 6 / 25
Adoption 5 / 25
Maturity 13 / 25
Community 7 / 25

How are scores calculated?

Stars

10

Forks

1

Language

Haskell

License

BSD-3-Clause

Last pushed

Dec 24, 2025

Commits (30d)

0

Get this data via API

curl "https://pt-edge.onrender.com/api/v1/quality/nlp/ocramz/ncd-tree"

Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.