Calculate various string metrics efficiently; profiling libraries

 This library provides efficient implementations of various strings metric
 algorithms. It works with strict Text values.
 .
 The current version implements the following algorithms:
 .
  * Levenshtein distance
  * Normalized Levenshtein distance
  * Damerau-Levenshtein distance
  * Normalized Damerau-Levenshtein distance
  * Hamming distance
  * Jaro distance
  * Jaro-Winkler distance
  * Overlap coefficient
  * Jaccard similarity coefficient
 .
 This package provides a library for the Haskell programming language, compiled
 for profiling. See http://www.haskell.org/ for more information on Haskell.