HMM alternatives and similar packages

Based on the "Algorithms" category.
Alternatively, view HMM alternatives based on common mentions on social networks and blogs.

• build

  9.5 0.0 HMM VS build

  Build Systems à la Carte

• arithmoi

  9.5 0.0 HMM VS arithmoi

  Number theory: primes, arithmetic functions, modular computations, special sequences

Clean code begins in your IDE with SonarLint

Up your coding game and discover issues early. SonarLint is a free plugin that helps you find & fix bugs and security issues from the moment you start writing code. Install from your favorite IDE marketplace today.

Promo www.sonarlint.org



• toysolver

  9.3 0.0 HMM VS toysolver

  My sandbox for experimenting with solver algorithms.

• ersatz

  8.9 0.0 HMM VS ersatz

  A monad for interfacing with external SAT solvers

• iproute

  8.8 0.0 HMM VS iproute

  IP Routing Table in Haskell

• aeson-diff

  8.4 0.0 HMM VS aeson-diff

  Generate and apply diffs between JSON documents.

• graphs

  8.3 0.0 HMM VS graphs

  a monadic graph library

• funsat

  8.2 0.0 HMM VS funsat

  An efficient, embeddable DPLL SAT solver in Haskell

• primes

  8.1 0.0 HMM VS primes

  Prime Numbers for Haskell

• union-find

  7.9 0.0 HMM VS union-find

  Efficient union and equivalence testing of sets.

• imj-animation

  7.9 3.5 HMM VS imj-animation

  Monorepo for a multi-player game engine, and game examples

• presburger

  7.8 0.0 HMM VS presburger

  Decision procedures for Presburger arithmetic in Haskell

• text-metrics

  7.7 0.0 HMM VS text-metrics

  Calculate various string metrics efficiently in Haskell

• search-algorithms

  7.6 0.0 HMM VS search-algorithms

  Haskell library containing common graph search algorithms

• lca

  7.5 0.0 HMM VS lca

  Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing

• ADPfusion

  7.4 0.0 HMM VS ADPfusion

  Efficient, high-level dynamic programming

• dtw

  6.8 0.0 HMM VS dtw

  Implementation of Dynamic Time Warping in Haskell

• Adaptive

  6.8 0.0 HMM VS Adaptive

  Library for incremental computing.

• edit-distance

  6.4 0.0 HMM VS edit-distance

  Edit distance library for Haskell
  

• ListTree

  6.3 0.0 HMM VS ListTree

  A List monad transformer and related tools

• treeviz

  6.2 0.0 HMM VS treeviz

  Haskell library for visualizing algorithmic decomposition of computations.

• qchas

  6.1 0.0 HMM VS qchas

  A library for implementing Quantum Algorithms

• incremental-sat-solver

  6.1 0.0 HMM VS incremental-sat-solver

  Simple, Incremental SAT Solving as a Haskell Library

• binary-search

  6.1 0.0 HMM VS binary-search

  Binary and exponential searches

• integer-logarithms

  6.0 0.0 HMM VS integer-logarithms

  Integer logarithms, originally split from arithmoi package
  

• cmaes

  5.7 0.0 L1 HMM VS cmaes

  CMA-ES wrapper in Haskell

• twentyseven

  5.7 0.0 HMM VS twentyseven

  Rubik's cube solver in Haskell

• sgd

  5.2 0.0 HMM VS sgd

  Stochastic gradient descent Haskell library

• DP

  5.2 0.0 HMM VS DP

  Holder for a bunch of semirings used in ChartParsing

• GraphSCC

  5.0 0.0 HMM VS GraphSCC

  Tarjan's algorithm for computing strongly connected components

• infinite-search

  4.8 0.0 HMM VS infinite-search

  An implementation of Martin Escardo's exhaustively searchable sets in Haskell.

• TrieMap

  4.5 0.0 HMM VS TrieMap

  Generalized tries for Haskell

• nonlinear-optimization-ad

  4.5 0.0 HMM VS nonlinear-optimization-ad

  Several Haskell packages for numerical optimizations.

• jps

  4.4 0.0 HMM VS jps

  :point_right: jump point search for Haskell

• spacefill

  4.3 0.0 HMM VS spacefill

  Space-filling curves

• KMP

  4.2 0.0 HMM VS KMP

  Knuth–Morris–Pratt string searching algorithm

• union-find-array

  4.2 0.0 HMM VS union-find-array

  ST based union find data structure
  

• edit-distance-vector

  4.1 0.0 HMM VS edit-distance-vector

  Calculate edit scripts and distances between Vectors.

• graph-generators

  4.1 0.0 HMM VS graph-generators

  A Haskell library for creating random Data.Graph instances using several pop

• adp-multi

  3.8 0.0 HMM VS adp-multi

  Prototype of ADP for MCFL (multiple context-free languages)
  

• primal

  3.8 0.0 HMM VS primal

  Primitive World of Haskell

• pathfinding

  3.7 0.0 HMM VS pathfinding

  Haskell pathfinding library

• primesieve

  3.6 1.7 HMM VS primesieve

  A collection of packages related to math, algorithms and science, in Haskell.

• edit-distance-linear

  3.6 0.0 HMM VS edit-distance-linear

  Levenshtein edit distance in linear memory (also turns out to be faster than C++)

• dgim

  3.4 0.0 HMM VS dgim

  :chart_with_upwards_trend: Implementation of the DGIM algorithm in Haskell.

• pell

  3.1 0.0 HMM VS pell

  Haskell Package to solve the Generalized Pell Equation

• epanet-haskell

  2.8 0.0 L2 HMM VS epanet-haskell

  Call the EPANET toolkit via Haskell's Foreign Function Interface

• MIP

  2.7 0.0 HMM VS MIP

  Libraries for reading/writing MIP problem files, invoking external MIP solvers, etc. in Haskell

• fibonacci

  2.5 0.0 HMM VS fibonacci

  Fast computation of Fibonacci numbers in Haskell

• longshot

  2.4 0.0 HMM VS longshot

  Fast Brute-force search using parallelism

* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.

Do you think we are missing an alternative of HMM or a related project?

Collect and Analyze Billions of Data Points in Real Time sponsored www.influxdata.com

Popular Comparisons

• HMM
  vs
  dtw
• HMM
  vs
  arithmoi
• HMM
  vs
  graph-generators
• HMM
  vs
  lca
• HMM
  vs
  twentyseven

Updating dependencies is time-consuming. sponsored blog.mergify.com