Popularity
3.1
Growing
Activity
6.9
Declining
2
2
0
Monthly Downloads: 55
Programming language: Haskell
License: BSD 3clause "New" or "Revised" License
Tags:
Algorithms
Edit
Latest version: v0.2.0.2
editdistancelinear alternatives and similar packages
Based on the "edit" category

editdistance
Levenshtein and restricted DamerauLevenshtein edit distances 
editdistancevector
Calculate edit distances and edit scripts between vectors.
Do you think we are missing an alternative of editdistancelinear or a related project?
README
editdistancelinear
The pure Haskell implementation of the Levenshtein edit distance, with linear space complexity.
Comparison
There are already several other existing implementations, but the goals and design decisions vary. In particular, this package is intended to be used to:
 compare long strings (think tens of thousands of characters), driving the implementation to live in the
ST
monad and aim at linear space complexity to lower GC pressure;  not care about Unicode, thus accepting
ByteString
s and comparing them bytebybyte rather than characterbycharacter (or glyphbyglyph, or whatever is the right notion of an edit for Unicode).
Among the alternatives:
 textmetrics — uses a similar algorithm, but cares about Unicode, making it 45 times slower.
 editdistance — uses a very different algorithm (which we might implement here one day with huge potential benefits), which tends to consume more memory (I'm not up for estimating its space asymptotics, though).