Unicode normalization http://github.com/harendra-kumar/unicode-transforms

Version on this page:0.2.1
LTS Haskell 8.2:0.2.1
Stackage Nightly 2017-02-25:0.3.0
Latest on Hackage:0.3.0
BSD3 licensed by Harendra Kumar
Maintained by harendra.kumar@gmail.com

Module documentation for 0.2.1

Unicode Transforms

Hackage Build Status Windows Build status Coverage Status

Fast Unicode 9.0 normalization in Haskell (NFC, NFKC, NFD, NFKD).

What is normalization?

Unicode characters with adornments (e.g. Á) can be represented in two different forms, as a single composed character (U+00C1 = Á) or as multiple decomposed characters (U+0041(A) U+0301( ́ ) = Á). They are differently encoded byte sequences but for humans they have exactly the same visual appearance.

A regular byte comparison may tell that two strings are different even though they might be equivalent. We need to convert both the strings in a normalized form using the Unicode Character Database before we can compare them for equivalence. For example:

>> import Data.Text.Normalize
>> normalize NFC "\193" == normalize NFC "\65\769"


Please use https://github.com/harendra-kumar/unicode-transforms to raise issues, or send pull requests.



  • Support Unicode version 9.0


  • Improve speed and resource hog during compilation


  • Support Unicode version 8.0
  • Switch to pure Haskell implementation

  • Initial release based on utf8proc C implementation
Used by 2 packages:
comments powered byDisqus