Alternatives and similar repositories for libfuzzymatch:

Users that are interested in libfuzzymatch are comparing it to the libraries listed below

• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated 2 years ago
• lysevi / nkvdb
  nkvdb - is a numeric time-series database.
  ☆35Updated 7 years ago
• pschanely / scoredb
  A simple database optimized for returning results by custom scoring functions.
  ☆20Updated 8 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 4 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 6 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆49Updated 9 months ago
• seiflotfy / cmts
  Count-Min Tree Sketch: Approximate counting for NLP
  ☆10Updated 7 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆51Updated 7 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• halayli / lthread_cpp
  Lthread C++11 binding
  ☆10Updated 10 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆26Updated 5 years ago
• patrickfrey / strus
  Library implementing the storage and the query evaluation for a text search engine. It uses on a key value store database interface to st…
  ☆47Updated 3 years ago
• willemt / bmon
  Batch Monitor - Gain performance by combining work from multiple threads into a single batch
  ☆30Updated 9 years ago
• backtrace-labs / stuffed-record-stream
  Backtrace.io's resilient log record framing format
  ☆37Updated 2 years ago
• splatlab / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆15Updated 6 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• demerphq / BeagleHash
  Fast 64 bit evolved hash.
  ☆32Updated 7 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆116Updated 7 years ago
• btrask / lsmdb
  Proof of concept LSM-tree built on MDB
  ☆17Updated 9 years ago
• fsaintjacques / jitmap
  LLVM-jitted bitmaps
  ☆27Updated 4 years ago
• abau / cppsat
  Propositional Encodings in C++11
  ☆18Updated 6 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 2 years ago
• tokenrove / fixie-trie
  Compact tries for fixed-width keys
  ☆25Updated 6 years ago
• efficient / fast-succinct-trie
  ☆25Updated 7 years ago
• art4711 / random-double
  An algorithm for generating random doubles.
  ☆12Updated 7 years ago
• hnsl / librcd
  A library for Rapid {C|Concurrency|Correct} Development
  ☆34Updated 9 years ago
• lvv / lvvlib
  C++ utility library
  ☆24Updated 11 years ago
• vmg / libewok
  EWAH Compressed Bitmaps
  ☆25Updated 4 years ago
• ronmrdechai / Pie
  Provide an idiomatic C++ interface to CPython's C API.
  ☆27Updated 7 years ago