Alternatives and similar repositories for tongrams_estimation:

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

• angeloskath / supervised-lda
  A flexible variational inference LDA library.
  ☆22Updated 5 years ago
• jermp / autocomplete
  Efficient and effective query auto-completion in C++.
  ☆53Updated last year
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• talwagner / quadsketch
  Implementation of QuadSketch algorithm
  ☆11Updated 2 years ago
• benob / openfst-utils
  Utilities for manipulating finite state transducers with the OpenFst library.
  ☆30Updated 7 years ago
• jermp / tongrams
  A C++ library providing fast language model queries in compressed space.
  ☆129Updated last year
• JoshEngels / FLINNG
  A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing
  ☆19Updated last year
• huggingface / spm_precompiled
  Highly specialized crate to parse and use `google/sentencepiece` 's precompiled_charsmap in `tokenizers`
  ☆18Updated 2 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆26Updated 5 years ago
• nowlab / DALM
  An Efficient Language Model Using Double-Array Structures
  ☆17Updated 4 years ago
• VincentShenbw / similarityjoin
  Implementation of many similarity join algorithms.
  ☆15Updated 10 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 2 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• google / refr
  A framework for building reranking models.
  ☆28Updated 9 years ago
• n0mad / octopi
  Playing with arithmetic coding and RNNs
  ☆22Updated 8 years ago
• krocki / manifold
  Content Addressable Memory using dimensionality reduction
  ☆12Updated 7 years ago
• graehl / carmel
  finite-state toolkit, EM and Bayesian (Gibbs sampling) training for FST and context-free derivation forests
  ☆41Updated 2 years ago
• marian-nmt / amun
  Fast stand-alone C++ decoder for RNN-based NMT models
  ☆25Updated 4 years ago
• fujimotos / mbleven
  An efficient algorithm for k-bounded (Damerau-)Levenshtein distance
  ☆16Updated 6 years ago
• trisongz / pylines
  Simplifying parsing of large jsonline files in NLP Workflows
  ☆12Updated 3 years ago
• mjpost / bin
  bin files
  ☆13Updated 3 weeks ago
• asaparov / grammar
  Implementation of generative semantic grammar.
  ☆18Updated 2 years ago
• mjansche / opengrm-ngram
  Read-only unofficial mirror of the OpenGrm NGram Library
  ☆8Updated 5 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated 2 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 4 years ago
• nlescoua / faiss-quickeradc
  QuickerADC is an implementation of highly-efficient product quantizers leveraging SIMD shuffle instructions integrated into FAISS
  ☆15Updated 5 years ago
• oertl / bagminhash
  BagMinHash - Minwise Hashing Algorithm for Weighted Sets
  ☆26Updated 4 years ago
• tkbtkysms / solca
  A Space-Optimal Grammar Compression
  ☆10Updated 4 years ago
• searchivarius / PyFastPFor
  Python bindings for the fast integer compression library FastPFor.
  ☆58Updated last year
• Empirical-org-Archive / automatic-fragment-detection
  A tool for detecting sentence fragments.
  ☆7Updated 8 years ago