name: DP
version: 0.1
synopsis: Pragmatic framework for dynamic programming
description: This module provides a simple declarative framework for dynamic programming optimization.
Users specify a dynamic programming problem as a simple haskell function that looks very similar to
mathematical recursion used in texts. The specification is then translated into a form that can be
solved efficiently by a modular solver. Includes solvers using memoization,
strict and lazy ordered tables, and recursion with a range of data structures for the underlying table.
This method also separates processing steps like pruning and debugging from the recursion itself, and
this package contains preliminary tools for beam search and tracing.
category: Algorithms, Math, Natural Language Processing
author: Sasha Rush
maintainer:
build-Type: Simple
cabal-version: >= 1.2
homepage: http://github.com/srush/SemiRings/tree/master
license: BSD3
library
exposed-modules: Data.DP,
Data.DP.Solvers,
Data.DP.Solvers.BottomUpLazy,
Data.DP.Solvers.TopDown,
Data.DP.Solvers.BottomUpStrict,
Data.DP.Solvers.Recursive,
Data.DP.Solvers.Beam,
Data.DP.Examples,
Data.DP.Examples.Fibonacci,
Data.DP.Examples.CheckerBoard,
Data.DP.Examples.HMM,
Data.DP.Examples.Bigram
other-modules :
Data.DP.Internals,
Data.DP.SolverInternal
ghc-options: -O2
build-Depends: base <= 4.0,
containers,
safe,
QuickCheck > 2.0,
array,
list-tries,
semiring >= 0.3,
mtl > 1.1