The DP package

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.

Properties

Versions	0.1, 0.1.1
Dependencies	array, base (≤4.0), containers, list-tries, mtl (>1.1), QuickCheck (>2.0), safe, semiring (≥0.3)
License	BSD3
Author	Sasha Rush
Maintainer	<srush at mit dot edu>
Category	Algorithms, Math, Natural Language Processing
Home page	http://github.com/srush/SemiRings/tree/master
Upload date	Mon Mar 8 04:52:12 UTC 2010
Uploaded by	SashaRush
Build failure	ghc-6.12 (log), ghc-7.0 (log), ghc-7.4 (log)

Modules

Data
- Data.DP
  - Data.DP.Examples
    - Data.DP.Examples.Bigram
    - Data.DP.Examples.CheckerBoard
    - Data.DP.Examples.Fibonacci
    - Data.DP.Examples.HMM
  - Data.DP.SolverAPI
  - Data.DP.Solvers
    - Data.DP.Solvers.Beam
    - Data.DP.Solvers.BottomUpLazy
    - Data.DP.Solvers.BottomUpStrict
    - Data.DP.Solvers.Recursive
    - Data.DP.Solvers.TopDown

Downloads

DP-0.1.1.tar.gz (Cabal source package)
package description (included in the package)