name: edit-distance-vector
version: 1.0
synopsis: Calculate edit distances and edit scripts between vectors.
description:
An implementation of the Wagnerâ€“Fischer dynamic programming algorithm to
find the optimal edit script and cost between two sequences.
.
The implementation in this package is specialised to sequences represented
with "Data.Vector" but is otherwise agnostic to:
.
* The type of values in the vectors;
.
* The type representing edit operations; and
.
* The type representing the cost of operations.
.
homepage: https://github.com/thsutton/edit-distance-vector
license: BSD3
license-file: LICENSE
author: Thomas Sutton
maintainer: me@thomas-sutton.id.au
copyright: (c) 2015 Thomas Sutton and others.
category: Data, Data Structures, Algorithms
build-type: Simple
extra-source-files: README.md, CHANGELOG.md
cabal-version: >=1.10
source-repository HEAD
type: git
location: https://github.com/thsutton/edit-distance-vector
library
default-language: Haskell2010
hs-source-dirs: lib
exposed-modules:
Data.Vector.Distance
build-depends:
base >=4.7 && <4.8
, vector >= 0.8
test-suite properties
default-language: Haskell2010
type: exitcode-stdio-1.0
hs-source-dirs: test
main-is: properties.hs
build-depends:
base
, QuickCheck
, edit-distance-vector
, quickcheck-instances
, vector