-
SeekStorm
- Warsaw, Poland
- https://seekstorm.com
- in/wolfgarbe
- https://medium.com/@wolfgarbe
- https://seekstorm.com/blog
- @seekstorm
Stars
C# client for the SeekStorm vector & lexical search server
Python client for the SeekStorm vector & lexical search server
EdgeParse converts any digital PDF into Markdown, JSON (with bounding boxes), HTML, or plain text — deterministically, without a JVM, without a GPU, and with best-in-class accuracy on the 200-docum…
snowball_stemmers_rs: a Snowball stemmer in 38 languages, in Rust
k-Medoids clustering in Rust with the FasterPAM algorithm
SymSpellComplete, a typo-tolerant autocomplete library in Rust.
Fast, indexed regexp search over large file trees
SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm
Fast spell-checking library - Pure C99 implementation of SymSpell algorithm
Full Text Search Engine - built for Hackers not Hyperscalers
SeekStorm: vector & lexical search - in-process library & multi-tenancy server, in Rust.
PruningRadixTrie - 1000x faster Radix trie for prefix search & auto-complete
SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm
Full text search that feels like a numpy array
Scalar is an open-source API platform: 🌐 Modern REST API Client 📖 Beautiful API References …
Simple, Fast, Code first and Compile time generated OpenAPI documentation for Rust
A high-level idiomatic Rust wrapper around Pdfium, the C++ PDF library used by the Google Chromium project.
Data structure for fast ranked autocomplete based on a given prefix, implemented in Go.
License and API key management tool and validation API for developers
Painless PDF generation for node and the browser
Intuitive yet powerful invoice generator for freelancers, business and everyone else
Rust implementation of Pruning Radix Trie, originally by Wolf Garbe
PyPruningRadixTrie - Python version of super fast Radix trie for prefix search & auto-complete
Dynamic Score-Decomposed Tries which more efficiently solve the prefix autocomplete problem