Yet another library for hidden Markov models

learning-hmm alternatives and similar packages

Based on the "Algorithms" category

• build

  9.5 4.8 learning-hmm VS build

  Build systems a la carte

• arithmoi

  9.4 8.7 learning-hmm VS arithmoi

  Efficient basic number-theoretic functions. Primes, powers, integer logarithms.

• toysolver

  9.3 7.4 learning-hmm VS toysolver

  Assorted decision procedures for SAT, Max-SAT, PB, MIP, etc

• ersatz

  9.1 5.3 learning-hmm VS ersatz

  A monad for expressing SAT or QSAT problems using observable sharing.

• iproute

  8.9 4.5 learning-hmm VS iproute

  IP Routing Table

• graphs

  8.5 2.4 learning-hmm VS graphs

  A simple monadic graph library

• HMM

  8.2 0.0 learning-hmm VS HMM

  A hidden markov model library

• primes

  8.2 0.0 learning-hmm VS primes

  Efficient, purely functional generation of prime numbers

• funsat

  8.1 0.0 learning-hmm VS funsat

  A modern DPLL-style SAT solver

• presburger

  7.9 0.9 learning-hmm VS presburger

  A decision procedure for quantifier-free linear arithmetic.

• aeson-diff

  7.8 2.4 learning-hmm VS aeson-diff

  Extract and apply patches to JSON documents.

• union-find

  7.8 0.0 learning-hmm VS union-find

  Efficient union and equivalence testing of sets.

• text-metrics

  7.7 4.3 learning-hmm VS text-metrics

  Calculate various string metrics efficiently

• imj-animation

  7.7 0.0 learning-hmm VS imj-animation

  Animation Framework

• lca

  7.5 2.7 learning-hmm VS lca

  O(log n) persistent on-line lowest common ancestor calculation without preprocessing

• search-algorithms

  7.2 2.4 learning-hmm VS search-algorithms

  Common graph search algorithms

• Adaptive

  7.1 0.0 learning-hmm VS Adaptive

  Library for incremental computing.

• dtw

  7.0 0.0 learning-hmm VS dtw

  (Fast) Dynamic Time Warping

• treeviz

  6.5 0.0 learning-hmm VS treeviz

  Visualization of computation decomposition trees.

• edit-distance

  6.4 2.2 learning-hmm VS edit-distance

  Levenshtein and restricted Damerau-Levenshtein edit distances

• qchas

  6.2 0.3 learning-hmm VS qchas

  A library for implementing Quantum Algorithms

• ADPfusion

  6.2 0.0 learning-hmm VS ADPfusion

  Efficient, high-level dynamic programming.

• incremental-sat-solver

  6.1 0.0 learning-hmm VS incremental-sat-solver

  Simple, Incremental SAT Solving as a Library

• integer-logarithms

  5.4 2.0 learning-hmm VS integer-logarithms

  Integer logarithms.

• ListTree

  5.3 0.0 learning-hmm VS ListTree

  Trees and monadic trees expressed as monadic lists where the underlying monad is a list

• cmaes

  5.0 0.0 L1 learning-hmm VS cmaes

  CMA-ES wrapper in Haskell

• sgd

  4.8 7.0 learning-hmm VS sgd

  Stochastic gradient descent

• nonlinear-optimization-ad

  4.8 6.2 learning-hmm VS nonlinear-optimization-ad

  Wrapper of nonlinear-optimization package for using with AD package

• TrieMap

  4.6 0.0 learning-hmm VS TrieMap

  Automatic type inference of generalized tries with Template Haskell.

• binary-search

  4.6 0.0 learning-hmm VS binary-search

  Binary and exponential searches

• union-find-array

  4.3 0.0 learning-hmm VS union-find-array

  union find data structure

• edit-distance-vector

  4.3 0.0 learning-hmm VS edit-distance-vector

  Calculate edit distances and edit scripts between vectors.

• KMP

  4.3 0.7 learning-hmm VS KMP

  Knuth–Morris–Pratt string searching algorithm

• primesieve

  4.3 1.9 learning-hmm VS primesieve

  FFI bindings for the primesieve library.

• DP

  4.1 0.0 learning-hmm VS DP

  Pragmatic framework for dynamic programming

• graph-generators

  4.1 0.0 learning-hmm VS graph-generators

  Functions for generating structured or random FGL graphs

• infinite-search

  4.1 0.0 learning-hmm VS infinite-search

  Exhaustively searchable infinite sets.

• pathfinding

  4.0 0.0 learning-hmm VS pathfinding

  pathfinding in grid and graphs

• jps

  4.0 0.0 learning-hmm VS jps

  Jump point search for Haskell

• spacefill

  3.8 0.0 learning-hmm VS spacefill

  Generators for space-filling curves.

• GraphSCC

  3.1 0.0 learning-hmm VS GraphSCC

  Tarjan's algorithm for computing the strongly connected components of a graph.

• edit-distance-linear

  3.1 6.7 learning-hmm VS edit-distance-linear

  Efficient implementation of the Levenshtein edit distance in linear memory.

• fibonacci

  2.9 0.0 learning-hmm VS fibonacci

  Fast computation of Fibonacci numbers.

• twentyseven

  2.9 0.0 learning-hmm VS twentyseven

  Rubik's cube solver

• epanet-haskell

  2.9 0.0 L2 learning-hmm VS epanet-haskell

  Haskell binding for EPANET

• dgim

  2.5 0.0 learning-hmm VS dgim

  Implementation of DGIM algorithm

• stable-marriage

  2.5 0.0 learning-hmm VS stable-marriage

  algorithms around stable marriage

• primes-type

  2.4 0.0 learning-hmm VS primes-type

  Type-safe prime numbers.

• bordacount

  2.4 0.0 learning-hmm VS bordacount

  Implementation of the Borda count election method.

• adp-multi

  2.1 0.0 learning-hmm VS adp-multi

  ADP for multiple context-free languages

* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest. Visit our partner's website for more details.

Do you think we are missing an alternative of learning-hmm or a related project?

Popular Comparisons

• learning-hmm
  vs
  twentyseven
• learning-hmm
  vs
  lca
• learning-hmm
  vs
  arithmoi
• learning-hmm
  vs
  ADPfusionSet
• learning-hmm
  vs
  graph-generators

SaaSHub - Software Alternatives and Reviews View more from us